./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/queue_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/queue_longer.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:36:27,502 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:36:27,556 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:36:27,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:36:27,560 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:36:27,580 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:36:27,581 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:36:27,581 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:36:27,581 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:36:27,581 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:36:27,582 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:36:27,582 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:36:27,582 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:36:27,582 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:36:27,583 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:36:27,583 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:36:27,583 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:36:27,583 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:36:27,583 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:36:27,583 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:36:27,583 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:36:27,584 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:36:27,584 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:36:27,584 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:36:27,584 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:36:27,584 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:36:27,584 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:36:27,584 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:36:27,584 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:36:27,584 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:36:27,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:36:27,584 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:36:27,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:36:27,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:36:27,585 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:36:27,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:36:27,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:36:27,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:36:27,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:36:27,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:36:27,586 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:36:27,586 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:36:27,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:36:27,586 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:36:27,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:36:27,586 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:36:27,586 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:36:27,586 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-jdk21/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 -> 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 [2025-01-10 00:36:27,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:36:27,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:36:27,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:36:27,841 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:36:27,841 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:36:27,842 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_longer.i [2025-01-10 00:36:29,105 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf0b03715/ac2ae66977254dfcb68ca18c67af1b70/FLAG32a601ed5 [2025-01-10 00:36:29,511 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:36:29,512 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/queue_longer.i [2025-01-10 00:36:29,525 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf0b03715/ac2ae66977254dfcb68ca18c67af1b70/FLAG32a601ed5 [2025-01-10 00:36:29,542 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf0b03715/ac2ae66977254dfcb68ca18c67af1b70 [2025-01-10 00:36:29,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:36:29,545 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:36:29,547 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:36:29,548 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:36:29,551 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:36:29,551 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:36:29" (1/1) ... [2025-01-10 00:36:29,552 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f93131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:29, skipping insertion in model container [2025-01-10 00:36:29,552 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:36:29" (1/1) ... [2025-01-10 00:36:29,592 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:36:29,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:36:29,902 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:36:29,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:36:30,033 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:36:30,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:30 WrapperNode [2025-01-10 00:36:30,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:36:30,036 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:36:30,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:36:30,036 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:36:30,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:30" (1/1) ... [2025-01-10 00:36:30,068 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:30" (1/1) ... [2025-01-10 00:36:30,121 INFO L138 Inliner]: procedures = 274, calls = 859, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 1040 [2025-01-10 00:36:30,122 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:36:30,122 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:36:30,122 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:36:30,122 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:36:30,130 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:30" (1/1) ... [2025-01-10 00:36:30,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:30" (1/1) ... [2025-01-10 00:36:30,143 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:30" (1/1) ... [2025-01-10 00:36:30,175 INFO L175 MemorySlicer]: Split 844 memory accesses to 4 slices as follows [2, 5, 403, 434]. 51 percent of accesses are in the largest equivalence class. The 810 initializations are split as follows [2, 5, 400, 403]. The 16 writes are split as follows [0, 0, 2, 14]. [2025-01-10 00:36:30,176 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:30" (1/1) ... [2025-01-10 00:36:30,176 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:30" (1/1) ... [2025-01-10 00:36:30,209 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:30" (1/1) ... [2025-01-10 00:36:30,214 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:30" (1/1) ... [2025-01-10 00:36:30,220 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:30" (1/1) ... [2025-01-10 00:36:30,227 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:30" (1/1) ... [2025-01-10 00:36:30,230 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:30" (1/1) ... [2025-01-10 00:36:30,241 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:36:30,242 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:36:30,242 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:36:30,242 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:36:30,243 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:30" (1/1) ... [2025-01-10 00:36:30,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:36:30,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:36:30,270 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:36:30,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:36:30,288 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-01-10 00:36:30,289 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-01-10 00:36:30,289 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-01-10 00:36:30,289 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-01-10 00:36:30,289 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:36:30,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:36:30,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:36:30,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:36:30,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 00:36:30,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:36:30,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:36:30,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:36:30,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 00:36:30,290 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:36:30,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:36:30,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:36:30,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:36:30,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:36:30,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 00:36:30,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:36:30,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:36:30,293 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:36:30,421 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:36:30,423 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:36:31,385 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:36:31,385 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:36:35,676 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:36:35,676 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:36:35,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:36:35 BoogieIcfgContainer [2025-01-10 00:36:35,676 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:36:35,678 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:36:35,678 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:36:35,681 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:36:35,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:36:29" (1/3) ... [2025-01-10 00:36:35,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb6b143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:36:35, skipping insertion in model container [2025-01-10 00:36:35,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:30" (2/3) ... [2025-01-10 00:36:35,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb6b143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:36:35, skipping insertion in model container [2025-01-10 00:36:35,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:36:35" (3/3) ... [2025-01-10 00:36:35,682 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2025-01-10 00:36:35,692 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:36:35,693 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_longer.i that has 3 procedures, 159 locations, 1 initial locations, 2 loop locations, and 72 error locations. [2025-01-10 00:36:35,694 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:36:35,768 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 00:36:35,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 172 transitions, 358 flow [2025-01-10 00:36:35,848 INFO L124 PetriNetUnfolderBase]: 14/170 cut-off events. [2025-01-10 00:36:35,849 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:36:35,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 170 events. 14/170 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 524 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 142. Up to 2 conditions per place. [2025-01-10 00:36:35,853 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 172 transitions, 358 flow [2025-01-10 00:36:35,857 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 169 transitions, 350 flow [2025-01-10 00:36:35,861 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:36:35,868 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;@44e4f879, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:36:35,868 INFO L334 AbstractCegarLoop]: Starting to check reachability of 134 error locations. [2025-01-10 00:36:35,891 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:36:35,891 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-01-10 00:36:35,891 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:36:35,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:35,892 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 00:36:35,892 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:35,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:35,895 INFO L85 PathProgramCache]: Analyzing trace with hash 72872, now seen corresponding path program 1 times [2025-01-10 00:36:35,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:35,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775337895] [2025-01-10 00:36:35,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:35,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:35,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 00:36:36,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 00:36:36,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:36,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:36,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:36,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:36,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775337895] [2025-01-10 00:36:36,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775337895] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:36,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:36,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:36:36,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095560717] [2025-01-10 00:36:36,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:36,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:36:36,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:36,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:36:36,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:36:36,636 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 172 [2025-01-10 00:36:36,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 169 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:36,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:36,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 172 [2025-01-10 00:36:36,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:37,321 INFO L124 PetriNetUnfolderBase]: 1744/4653 cut-off events. [2025-01-10 00:36:37,321 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-01-10 00:36:37,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7479 conditions, 4653 events. 1744/4653 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 37024 event pairs, 1393 based on Foata normal form. 182/3587 useless extension candidates. Maximal degree in co-relation 7362. Up to 2745 conditions per place. [2025-01-10 00:36:37,368 INFO L140 encePairwiseOnDemand]: 162/172 looper letters, 58 selfloop transitions, 2 changer transitions 0/154 dead transitions. [2025-01-10 00:36:37,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 154 transitions, 440 flow [2025-01-10 00:36:37,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:36:37,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:36:37,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2025-01-10 00:36:37,381 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7015503875968992 [2025-01-10 00:36:37,382 INFO L175 Difference]: Start difference. First operand has 162 places, 169 transitions, 350 flow. Second operand 3 states and 362 transitions. [2025-01-10 00:36:37,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 154 transitions, 440 flow [2025-01-10 00:36:37,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 154 transitions, 432 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:36:37,390 INFO L231 Difference]: Finished difference. Result has 151 places, 154 transitions, 316 flow [2025-01-10 00:36:37,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=151, PETRI_TRANSITIONS=154} [2025-01-10 00:36:37,395 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -11 predicate places. [2025-01-10 00:36:37,396 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 154 transitions, 316 flow [2025-01-10 00:36:37,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:37,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:37,396 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 00:36:37,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:36:37,397 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:37,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:37,398 INFO L85 PathProgramCache]: Analyzing trace with hash 72873, now seen corresponding path program 1 times [2025-01-10 00:36:37,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:37,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82645350] [2025-01-10 00:36:37,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:37,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:37,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 00:36:37,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 00:36:37,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:37,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:37,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:37,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:37,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82645350] [2025-01-10 00:36:37,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82645350] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:37,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:37,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:36:37,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476631478] [2025-01-10 00:36:37,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:37,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:36:37,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:37,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:36:37,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:36:37,829 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 172 [2025-01-10 00:36:37,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 154 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:37,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:37,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 172 [2025-01-10 00:36:37,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:38,398 INFO L124 PetriNetUnfolderBase]: 1744/4650 cut-off events. [2025-01-10 00:36:38,398 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-01-10 00:36:38,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7430 conditions, 4650 events. 1744/4650 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 36988 event pairs, 1393 based on Foata normal form. 3/3407 useless extension candidates. Maximal degree in co-relation 7419. Up to 2745 conditions per place. [2025-01-10 00:36:38,420 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 58 selfloop transitions, 2 changer transitions 0/151 dead transitions. [2025-01-10 00:36:38,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 151 transitions, 430 flow [2025-01-10 00:36:38,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:36:38,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:36:38,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2025-01-10 00:36:38,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6918604651162791 [2025-01-10 00:36:38,422 INFO L175 Difference]: Start difference. First operand has 151 places, 154 transitions, 316 flow. Second operand 3 states and 357 transitions. [2025-01-10 00:36:38,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 151 transitions, 430 flow [2025-01-10 00:36:38,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 151 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:36:38,424 INFO L231 Difference]: Finished difference. Result has 148 places, 151 transitions, 310 flow [2025-01-10 00:36:38,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=148, PETRI_TRANSITIONS=151} [2025-01-10 00:36:38,427 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -14 predicate places. [2025-01-10 00:36:38,427 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 151 transitions, 310 flow [2025-01-10 00:36:38,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:38,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:38,427 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:36:38,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:36:38,428 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:38,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:38,428 INFO L85 PathProgramCache]: Analyzing trace with hash -2121789934, now seen corresponding path program 1 times [2025-01-10 00:36:38,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:38,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991961362] [2025-01-10 00:36:38,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:38,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:38,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:36:38,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:36:38,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:38,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:38,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:38,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:38,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991961362] [2025-01-10 00:36:38,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991961362] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:38,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:38,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:36:38,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695057817] [2025-01-10 00:36:38,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:38,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:36:38,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:38,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:36:38,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:36:38,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 172 [2025-01-10 00:36:38,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 151 transitions, 310 flow. Second operand has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:38,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:38,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 172 [2025-01-10 00:36:38,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:39,030 INFO L124 PetriNetUnfolderBase]: 1744/4648 cut-off events. [2025-01-10 00:36:39,030 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-01-10 00:36:39,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7428 conditions, 4648 events. 1744/4648 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 37001 event pairs, 1393 based on Foata normal form. 1/3405 useless extension candidates. Maximal degree in co-relation 7417. Up to 2744 conditions per place. [2025-01-10 00:36:39,048 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 57 selfloop transitions, 3 changer transitions 0/149 dead transitions. [2025-01-10 00:36:39,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 149 transitions, 426 flow [2025-01-10 00:36:39,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:36:39,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:36:39,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 458 transitions. [2025-01-10 00:36:39,050 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6656976744186046 [2025-01-10 00:36:39,050 INFO L175 Difference]: Start difference. First operand has 148 places, 151 transitions, 310 flow. Second operand 4 states and 458 transitions. [2025-01-10 00:36:39,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 149 transitions, 426 flow [2025-01-10 00:36:39,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 149 transitions, 422 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:36:39,055 INFO L231 Difference]: Finished difference. Result has 147 places, 149 transitions, 308 flow [2025-01-10 00:36:39,055 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=308, PETRI_PLACES=147, PETRI_TRANSITIONS=149} [2025-01-10 00:36:39,056 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -15 predicate places. [2025-01-10 00:36:39,056 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 149 transitions, 308 flow [2025-01-10 00:36:39,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:39,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:39,056 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:36:39,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:36:39,056 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:39,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:39,057 INFO L85 PathProgramCache]: Analyzing trace with hash -2121789933, now seen corresponding path program 1 times [2025-01-10 00:36:39,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:39,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423311131] [2025-01-10 00:36:39,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:39,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:39,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:36:39,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:36:39,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:39,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:39,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:39,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:39,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423311131] [2025-01-10 00:36:39,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423311131] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:39,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:39,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:36:39,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939281520] [2025-01-10 00:36:39,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:39,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:36:39,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:39,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:36:39,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:36:39,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 172 [2025-01-10 00:36:39,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 149 transitions, 308 flow. Second operand has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:39,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:39,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 172 [2025-01-10 00:36:39,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:40,158 INFO L124 PetriNetUnfolderBase]: 1744/4646 cut-off events. [2025-01-10 00:36:40,159 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-01-10 00:36:40,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7427 conditions, 4646 events. 1744/4646 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 36963 event pairs, 1393 based on Foata normal form. 2/3405 useless extension candidates. Maximal degree in co-relation 7412. Up to 2744 conditions per place. [2025-01-10 00:36:40,175 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 57 selfloop transitions, 3 changer transitions 0/147 dead transitions. [2025-01-10 00:36:40,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 147 transitions, 424 flow [2025-01-10 00:36:40,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:36:40,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:36:40,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 458 transitions. [2025-01-10 00:36:40,177 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6656976744186046 [2025-01-10 00:36:40,177 INFO L175 Difference]: Start difference. First operand has 147 places, 149 transitions, 308 flow. Second operand 4 states and 458 transitions. [2025-01-10 00:36:40,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 147 transitions, 424 flow [2025-01-10 00:36:40,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 147 transitions, 418 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:36:40,179 INFO L231 Difference]: Finished difference. Result has 145 places, 147 transitions, 304 flow [2025-01-10 00:36:40,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=304, PETRI_PLACES=145, PETRI_TRANSITIONS=147} [2025-01-10 00:36:40,180 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -17 predicate places. [2025-01-10 00:36:40,180 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 147 transitions, 304 flow [2025-01-10 00:36:40,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:40,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:40,181 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:36:40,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:36:40,181 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:40,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:40,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1986886893, now seen corresponding path program 1 times [2025-01-10 00:36:40,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:40,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178897706] [2025-01-10 00:36:40,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:40,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:40,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:36:40,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:36:40,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:40,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:40,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:40,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:40,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178897706] [2025-01-10 00:36:40,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178897706] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:40,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:40,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:36:40,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323157318] [2025-01-10 00:36:40,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:40,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:36:40,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:40,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:36:40,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:36:40,544 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 172 [2025-01-10 00:36:40,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 147 transitions, 304 flow. Second operand has 4 states, 4 states have (on average 87.5) internal successors, (350), 4 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:40,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:40,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 172 [2025-01-10 00:36:40,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:40,984 INFO L124 PetriNetUnfolderBase]: 1703/4145 cut-off events. [2025-01-10 00:36:40,984 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-01-10 00:36:40,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6882 conditions, 4145 events. 1703/4145 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 30717 event pairs, 702 based on Foata normal form. 204/3609 useless extension candidates. Maximal degree in co-relation 6867. Up to 1414 conditions per place. [2025-01-10 00:36:41,004 INFO L140 encePairwiseOnDemand]: 151/172 looper letters, 74 selfloop transitions, 5 changer transitions 0/150 dead transitions. [2025-01-10 00:36:41,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 150 transitions, 469 flow [2025-01-10 00:36:41,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:36:41,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:36:41,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 435 transitions. [2025-01-10 00:36:41,007 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6322674418604651 [2025-01-10 00:36:41,007 INFO L175 Difference]: Start difference. First operand has 145 places, 147 transitions, 304 flow. Second operand 4 states and 435 transitions. [2025-01-10 00:36:41,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 150 transitions, 469 flow [2025-01-10 00:36:41,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 150 transitions, 463 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:36:41,009 INFO L231 Difference]: Finished difference. Result has 129 places, 131 transitions, 276 flow [2025-01-10 00:36:41,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=276, PETRI_PLACES=129, PETRI_TRANSITIONS=131} [2025-01-10 00:36:41,010 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -33 predicate places. [2025-01-10 00:36:41,010 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 131 transitions, 276 flow [2025-01-10 00:36:41,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.5) internal successors, (350), 4 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:41,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:41,010 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:36:41,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:36:41,010 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:41,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:41,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1986886892, now seen corresponding path program 1 times [2025-01-10 00:36:41,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:41,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944650077] [2025-01-10 00:36:41,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:41,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:41,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:36:41,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:36:41,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:41,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:41,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:41,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:41,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944650077] [2025-01-10 00:36:41,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944650077] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:41,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:41,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:36:41,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939521974] [2025-01-10 00:36:41,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:41,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:36:41,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:41,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:36:41,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:36:41,570 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 172 [2025-01-10 00:36:41,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 131 transitions, 276 flow. Second operand has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:41,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:41,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 172 [2025-01-10 00:36:41,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:42,005 INFO L124 PetriNetUnfolderBase]: 1703/3676 cut-off events. [2025-01-10 00:36:42,005 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2025-01-10 00:36:42,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6547 conditions, 3676 events. 1703/3676 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 24530 event pairs, 702 based on Foata normal form. 204/3341 useless extension candidates. Maximal degree in co-relation 2518. Up to 1414 conditions per place. [2025-01-10 00:36:42,018 INFO L140 encePairwiseOnDemand]: 153/172 looper letters, 74 selfloop transitions, 5 changer transitions 0/136 dead transitions. [2025-01-10 00:36:42,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 136 transitions, 445 flow [2025-01-10 00:36:42,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:36:42,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:36:42,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 441 transitions. [2025-01-10 00:36:42,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6409883720930233 [2025-01-10 00:36:42,020 INFO L175 Difference]: Start difference. First operand has 129 places, 131 transitions, 276 flow. Second operand 4 states and 441 transitions. [2025-01-10 00:36:42,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 136 transitions, 445 flow [2025-01-10 00:36:42,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 136 transitions, 435 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:36:42,023 INFO L231 Difference]: Finished difference. Result has 115 places, 117 transitions, 248 flow [2025-01-10 00:36:42,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=248, PETRI_PLACES=115, PETRI_TRANSITIONS=117} [2025-01-10 00:36:42,025 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -47 predicate places. [2025-01-10 00:36:42,025 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 117 transitions, 248 flow [2025-01-10 00:36:42,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:42,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:42,026 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:36:42,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:36:42,026 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:42,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:42,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1463949177, now seen corresponding path program 1 times [2025-01-10 00:36:42,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:42,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178357728] [2025-01-10 00:36:42,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:42,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:42,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 00:36:42,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 00:36:42,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:42,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:43,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:43,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:43,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178357728] [2025-01-10 00:36:43,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178357728] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:43,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:43,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:36:43,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34637608] [2025-01-10 00:36:43,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:43,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:36:43,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:43,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:36:43,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:36:43,612 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 172 [2025-01-10 00:36:43,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 117 transitions, 248 flow. Second operand has 7 states, 7 states have (on average 76.71428571428571) internal successors, (537), 7 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:43,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:43,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 172 [2025-01-10 00:36:43,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:44,259 INFO L124 PetriNetUnfolderBase]: 2502/5392 cut-off events. [2025-01-10 00:36:44,259 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-01-10 00:36:44,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9549 conditions, 5392 events. 2502/5392 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 38778 event pairs, 536 based on Foata normal form. 0/4394 useless extension candidates. Maximal degree in co-relation 3717. Up to 3436 conditions per place. [2025-01-10 00:36:44,279 INFO L140 encePairwiseOnDemand]: 163/172 looper letters, 125 selfloop transitions, 11 changer transitions 0/184 dead transitions. [2025-01-10 00:36:44,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 184 transitions, 659 flow [2025-01-10 00:36:44,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:36:44,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:36:44,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 663 transitions. [2025-01-10 00:36:44,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5506644518272426 [2025-01-10 00:36:44,281 INFO L175 Difference]: Start difference. First operand has 115 places, 117 transitions, 248 flow. Second operand 7 states and 663 transitions. [2025-01-10 00:36:44,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 184 transitions, 659 flow [2025-01-10 00:36:44,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 184 transitions, 647 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:36:44,288 INFO L231 Difference]: Finished difference. Result has 122 places, 127 transitions, 312 flow [2025-01-10 00:36:44,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=312, PETRI_PLACES=122, PETRI_TRANSITIONS=127} [2025-01-10 00:36:44,289 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -40 predicate places. [2025-01-10 00:36:44,290 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 127 transitions, 312 flow [2025-01-10 00:36:44,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.71428571428571) internal successors, (537), 7 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:44,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:44,291 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:36:44,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:36:44,291 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:44,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:44,291 INFO L85 PathProgramCache]: Analyzing trace with hash -2102207717, now seen corresponding path program 1 times [2025-01-10 00:36:44,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:44,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598796584] [2025-01-10 00:36:44,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:44,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:44,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:36:44,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:36:44,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:44,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:44,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:44,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:44,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598796584] [2025-01-10 00:36:44,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598796584] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:44,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:44,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:36:44,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308374351] [2025-01-10 00:36:44,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:44,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:36:44,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:44,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:36:44,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:36:44,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 172 [2025-01-10 00:36:44,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 127 transitions, 312 flow. Second operand has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:44,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:44,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 172 [2025-01-10 00:36:44,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:44,990 INFO L124 PetriNetUnfolderBase]: 2073/4641 cut-off events. [2025-01-10 00:36:44,991 INFO L125 PetriNetUnfolderBase]: For 207/207 co-relation queries the response was YES. [2025-01-10 00:36:44,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8317 conditions, 4641 events. 2073/4641 cut-off events. For 207/207 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 33352 event pairs, 892 based on Foata normal form. 375/4320 useless extension candidates. Maximal degree in co-relation 8044. Up to 1823 conditions per place. [2025-01-10 00:36:45,005 INFO L140 encePairwiseOnDemand]: 161/172 looper letters, 104 selfloop transitions, 3 changer transitions 0/158 dead transitions. [2025-01-10 00:36:45,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 158 transitions, 609 flow [2025-01-10 00:36:45,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:36:45,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:36:45,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 475 transitions. [2025-01-10 00:36:45,007 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.690406976744186 [2025-01-10 00:36:45,007 INFO L175 Difference]: Start difference. First operand has 122 places, 127 transitions, 312 flow. Second operand 4 states and 475 transitions. [2025-01-10 00:36:45,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 158 transitions, 609 flow [2025-01-10 00:36:45,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 158 transitions, 607 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:36:45,009 INFO L231 Difference]: Finished difference. Result has 116 places, 119 transitions, 300 flow [2025-01-10 00:36:45,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=300, PETRI_PLACES=116, PETRI_TRANSITIONS=119} [2025-01-10 00:36:45,010 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -46 predicate places. [2025-01-10 00:36:45,010 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 119 transitions, 300 flow [2025-01-10 00:36:45,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:45,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:45,011 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:36:45,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:36:45,011 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:45,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:45,011 INFO L85 PathProgramCache]: Analyzing trace with hash -2102207716, now seen corresponding path program 1 times [2025-01-10 00:36:45,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:45,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113040775] [2025-01-10 00:36:45,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:45,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:45,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:36:45,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:36:45,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:45,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:45,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:45,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:45,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113040775] [2025-01-10 00:36:45,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113040775] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:45,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:45,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:36:45,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158548498] [2025-01-10 00:36:45,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:45,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:36:45,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:45,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:36:45,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:36:45,124 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 172 [2025-01-10 00:36:45,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 119 transitions, 300 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 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-01-10 00:36:45,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:45,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 172 [2025-01-10 00:36:45,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:45,341 INFO L124 PetriNetUnfolderBase]: 1382/3055 cut-off events. [2025-01-10 00:36:45,341 INFO L125 PetriNetUnfolderBase]: For 182/182 co-relation queries the response was YES. [2025-01-10 00:36:45,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5511 conditions, 3055 events. 1382/3055 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 17497 event pairs, 703 based on Foata normal form. 55/2727 useless extension candidates. Maximal degree in co-relation 5503. Up to 1211 conditions per place. [2025-01-10 00:36:45,351 INFO L140 encePairwiseOnDemand]: 168/172 looper letters, 81 selfloop transitions, 3 changer transitions 0/132 dead transitions. [2025-01-10 00:36:45,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 132 transitions, 468 flow [2025-01-10 00:36:45,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:36:45,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:36:45,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2025-01-10 00:36:45,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.751937984496124 [2025-01-10 00:36:45,352 INFO L175 Difference]: Start difference. First operand has 116 places, 119 transitions, 300 flow. Second operand 3 states and 388 transitions. [2025-01-10 00:36:45,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 132 transitions, 468 flow [2025-01-10 00:36:45,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 132 transitions, 439 flow, removed 1 selfloop flow, removed 10 redundant places. [2025-01-10 00:36:45,355 INFO L231 Difference]: Finished difference. Result has 107 places, 109 transitions, 235 flow [2025-01-10 00:36:45,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=235, PETRI_PLACES=107, PETRI_TRANSITIONS=109} [2025-01-10 00:36:45,356 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -55 predicate places. [2025-01-10 00:36:45,356 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 109 transitions, 235 flow [2025-01-10 00:36:45,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 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-01-10 00:36:45,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:45,356 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:36:45,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:36:45,356 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:45,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:45,356 INFO L85 PathProgramCache]: Analyzing trace with hash -2074072585, now seen corresponding path program 1 times [2025-01-10 00:36:45,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:45,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901415124] [2025-01-10 00:36:45,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:45,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:45,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 00:36:45,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 00:36:45,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:45,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:45,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:45,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:45,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901415124] [2025-01-10 00:36:45,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901415124] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:45,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:45,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:36:45,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897968017] [2025-01-10 00:36:45,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:45,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:36:45,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:45,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:36:45,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:36:45,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 172 [2025-01-10 00:36:45,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 109 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:45,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:45,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 172 [2025-01-10 00:36:45,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:45,780 INFO L124 PetriNetUnfolderBase]: 1392/3119 cut-off events. [2025-01-10 00:36:45,780 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2025-01-10 00:36:45,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5502 conditions, 3119 events. 1392/3119 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 18120 event pairs, 1089 based on Foata normal form. 0/2730 useless extension candidates. Maximal degree in co-relation 5497. Up to 2216 conditions per place. [2025-01-10 00:36:45,789 INFO L140 encePairwiseOnDemand]: 170/172 looper letters, 60 selfloop transitions, 1 changer transitions 0/108 dead transitions. [2025-01-10 00:36:45,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 108 transitions, 355 flow [2025-01-10 00:36:45,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:36:45,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:36:45,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2025-01-10 00:36:45,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6996124031007752 [2025-01-10 00:36:45,790 INFO L175 Difference]: Start difference. First operand has 107 places, 109 transitions, 235 flow. Second operand 3 states and 361 transitions. [2025-01-10 00:36:45,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 108 transitions, 355 flow [2025-01-10 00:36:45,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 108 transitions, 352 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:36:45,793 INFO L231 Difference]: Finished difference. Result has 107 places, 108 transitions, 232 flow [2025-01-10 00:36:45,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=107, PETRI_TRANSITIONS=108} [2025-01-10 00:36:45,794 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -55 predicate places. [2025-01-10 00:36:45,794 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 108 transitions, 232 flow [2025-01-10 00:36:45,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:45,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:45,794 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:36:45,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:36:45,795 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:45,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:45,795 INFO L85 PathProgramCache]: Analyzing trace with hash -2074072586, now seen corresponding path program 1 times [2025-01-10 00:36:45,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:45,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292378960] [2025-01-10 00:36:45,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:45,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:45,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 00:36:45,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 00:36:45,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:45,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:45,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:45,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:45,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292378960] [2025-01-10 00:36:45,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292378960] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:45,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:45,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:36:45,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432557595] [2025-01-10 00:36:45,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:45,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:36:45,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:45,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:36:45,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:36:45,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 172 [2025-01-10 00:36:45,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 108 transitions, 232 flow. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:45,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:45,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 172 [2025-01-10 00:36:45,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:46,162 INFO L124 PetriNetUnfolderBase]: 1392/3052 cut-off events. [2025-01-10 00:36:46,163 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-01-10 00:36:46,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5422 conditions, 3052 events. 1392/3052 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 17382 event pairs, 1089 based on Foata normal form. 77/2795 useless extension candidates. Maximal degree in co-relation 5417. Up to 2216 conditions per place. [2025-01-10 00:36:46,175 INFO L140 encePairwiseOnDemand]: 168/172 looper letters, 60 selfloop transitions, 1 changer transitions 0/105 dead transitions. [2025-01-10 00:36:46,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 105 transitions, 348 flow [2025-01-10 00:36:46,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:36:46,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:36:46,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2025-01-10 00:36:46,177 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6918604651162791 [2025-01-10 00:36:46,177 INFO L175 Difference]: Start difference. First operand has 107 places, 108 transitions, 232 flow. Second operand 3 states and 357 transitions. [2025-01-10 00:36:46,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 105 transitions, 348 flow [2025-01-10 00:36:46,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 105 transitions, 347 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:36:46,179 INFO L231 Difference]: Finished difference. Result has 105 places, 105 transitions, 227 flow [2025-01-10 00:36:46,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=227, PETRI_PLACES=105, PETRI_TRANSITIONS=105} [2025-01-10 00:36:46,180 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -57 predicate places. [2025-01-10 00:36:46,180 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 105 transitions, 227 flow [2025-01-10 00:36:46,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:46,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:46,181 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:36:46,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:36:46,181 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:46,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:46,181 INFO L85 PathProgramCache]: Analyzing trace with hash 128261761, now seen corresponding path program 1 times [2025-01-10 00:36:46,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:46,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271851938] [2025-01-10 00:36:46,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:46,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:46,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 00:36:46,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 00:36:46,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:46,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:46,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:46,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:46,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271851938] [2025-01-10 00:36:46,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271851938] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:46,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:46,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:36:46,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986921162] [2025-01-10 00:36:46,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:46,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:36:46,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:46,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:36:46,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:36:46,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 172 [2025-01-10 00:36:46,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 105 transitions, 227 flow. Second operand has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:46,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:46,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 172 [2025-01-10 00:36:46,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:46,648 INFO L124 PetriNetUnfolderBase]: 1392/3028 cut-off events. [2025-01-10 00:36:46,648 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-01-10 00:36:46,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5399 conditions, 3028 events. 1392/3028 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 17080 event pairs, 1074 based on Foata normal form. 12/2730 useless extension candidates. Maximal degree in co-relation 5394. Up to 2187 conditions per place. [2025-01-10 00:36:46,657 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 66 selfloop transitions, 3 changer transitions 0/111 dead transitions. [2025-01-10 00:36:46,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 111 transitions, 378 flow [2025-01-10 00:36:46,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:36:46,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:36:46,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 466 transitions. [2025-01-10 00:36:46,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6773255813953488 [2025-01-10 00:36:46,659 INFO L175 Difference]: Start difference. First operand has 105 places, 105 transitions, 227 flow. Second operand 4 states and 466 transitions. [2025-01-10 00:36:46,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 111 transitions, 378 flow [2025-01-10 00:36:46,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 111 transitions, 377 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:36:46,660 INFO L231 Difference]: Finished difference. Result has 105 places, 103 transitions, 228 flow [2025-01-10 00:36:46,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=228, PETRI_PLACES=105, PETRI_TRANSITIONS=103} [2025-01-10 00:36:46,661 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -57 predicate places. [2025-01-10 00:36:46,661 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 103 transitions, 228 flow [2025-01-10 00:36:46,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:46,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:46,661 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:36:46,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:36:46,661 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:46,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:46,662 INFO L85 PathProgramCache]: Analyzing trace with hash 128261762, now seen corresponding path program 1 times [2025-01-10 00:36:46,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:46,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19131768] [2025-01-10 00:36:46,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:46,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:46,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 00:36:46,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 00:36:46,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:46,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:46,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:46,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:46,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19131768] [2025-01-10 00:36:46,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19131768] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:46,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:46,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:36:46,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991245584] [2025-01-10 00:36:46,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:46,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:36:46,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:46,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:36:46,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:36:47,052 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 172 [2025-01-10 00:36:47,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 103 transitions, 228 flow. Second operand has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:47,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:47,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 172 [2025-01-10 00:36:47,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:47,278 INFO L124 PetriNetUnfolderBase]: 1392/3004 cut-off events. [2025-01-10 00:36:47,278 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-01-10 00:36:47,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5400 conditions, 3004 events. 1392/3004 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 16790 event pairs, 1074 based on Foata normal form. 24/2730 useless extension candidates. Maximal degree in co-relation 5395. Up to 2187 conditions per place. [2025-01-10 00:36:47,287 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 66 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2025-01-10 00:36:47,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 109 transitions, 379 flow [2025-01-10 00:36:47,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:36:47,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:36:47,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 466 transitions. [2025-01-10 00:36:47,288 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6773255813953488 [2025-01-10 00:36:47,288 INFO L175 Difference]: Start difference. First operand has 105 places, 103 transitions, 228 flow. Second operand 4 states and 466 transitions. [2025-01-10 00:36:47,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 109 transitions, 379 flow [2025-01-10 00:36:47,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 109 transitions, 373 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:36:47,289 INFO L231 Difference]: Finished difference. Result has 103 places, 101 transitions, 224 flow [2025-01-10 00:36:47,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=224, PETRI_PLACES=103, PETRI_TRANSITIONS=101} [2025-01-10 00:36:47,290 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -59 predicate places. [2025-01-10 00:36:47,290 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 101 transitions, 224 flow [2025-01-10 00:36:47,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:47,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:47,291 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:36:47,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:36:47,291 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:47,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:47,291 INFO L85 PathProgramCache]: Analyzing trace with hash -318883013, now seen corresponding path program 1 times [2025-01-10 00:36:47,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:47,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070811542] [2025-01-10 00:36:47,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:47,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:47,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 00:36:47,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 00:36:47,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:47,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:47,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:47,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:47,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070811542] [2025-01-10 00:36:47,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070811542] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:47,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:47,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:36:47,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206544657] [2025-01-10 00:36:47,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:47,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:36:47,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:47,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:36:47,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:36:47,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 172 [2025-01-10 00:36:47,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 101 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:47,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:47,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 172 [2025-01-10 00:36:47,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:47,740 INFO L124 PetriNetUnfolderBase]: 1380/2992 cut-off events. [2025-01-10 00:36:47,740 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-01-10 00:36:47,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5376 conditions, 2992 events. 1380/2992 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 16809 event pairs, 1074 based on Foata normal form. 0/2706 useless extension candidates. Maximal degree in co-relation 5371. Up to 2176 conditions per place. [2025-01-10 00:36:47,752 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 66 selfloop transitions, 2 changer transitions 0/108 dead transitions. [2025-01-10 00:36:47,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 108 transitions, 375 flow [2025-01-10 00:36:47,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:36:47,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:36:47,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2025-01-10 00:36:47,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7189922480620154 [2025-01-10 00:36:47,758 INFO L175 Difference]: Start difference. First operand has 103 places, 101 transitions, 224 flow. Second operand 3 states and 371 transitions. [2025-01-10 00:36:47,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 108 transitions, 375 flow [2025-01-10 00:36:47,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 108 transitions, 369 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:36:47,760 INFO L231 Difference]: Finished difference. Result has 102 places, 100 transitions, 220 flow [2025-01-10 00:36:47,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=102, PETRI_TRANSITIONS=100} [2025-01-10 00:36:47,761 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -60 predicate places. [2025-01-10 00:36:47,761 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 100 transitions, 220 flow [2025-01-10 00:36:47,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:47,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:47,765 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:36:47,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:36:47,765 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:47,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:47,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1918874091, now seen corresponding path program 1 times [2025-01-10 00:36:47,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:47,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266720625] [2025-01-10 00:36:47,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:47,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:47,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 00:36:47,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 00:36:47,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:47,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:48,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:48,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:48,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266720625] [2025-01-10 00:36:48,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266720625] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:48,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:48,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 00:36:48,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150357011] [2025-01-10 00:36:48,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:48,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 00:36:48,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:48,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 00:36:48,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-10 00:36:48,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 172 [2025-01-10 00:36:48,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 100 transitions, 220 flow. Second operand has 10 states, 10 states have (on average 94.3) internal successors, (943), 10 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:48,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:48,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 172 [2025-01-10 00:36:48,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:49,443 INFO L124 PetriNetUnfolderBase]: 1717/3481 cut-off events. [2025-01-10 00:36:49,443 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-01-10 00:36:49,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6486 conditions, 3481 events. 1717/3481 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 19029 event pairs, 388 based on Foata normal form. 0/3243 useless extension candidates. Maximal degree in co-relation 6481. Up to 2364 conditions per place. [2025-01-10 00:36:49,452 INFO L140 encePairwiseOnDemand]: 159/172 looper letters, 117 selfloop transitions, 12 changer transitions 0/160 dead transitions. [2025-01-10 00:36:49,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 160 transitions, 608 flow [2025-01-10 00:36:49,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:36:49,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:36:49,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 957 transitions. [2025-01-10 00:36:49,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6182170542635659 [2025-01-10 00:36:49,457 INFO L175 Difference]: Start difference. First operand has 102 places, 100 transitions, 220 flow. Second operand 9 states and 957 transitions. [2025-01-10 00:36:49,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 160 transitions, 608 flow [2025-01-10 00:36:49,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 160 transitions, 604 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:36:49,459 INFO L231 Difference]: Finished difference. Result has 108 places, 101 transitions, 252 flow [2025-01-10 00:36:49,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=252, PETRI_PLACES=108, PETRI_TRANSITIONS=101} [2025-01-10 00:36:49,460 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -54 predicate places. [2025-01-10 00:36:49,460 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 101 transitions, 252 flow [2025-01-10 00:36:49,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 94.3) internal successors, (943), 10 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:49,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:49,461 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:36:49,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 00:36:49,461 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:49,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:49,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1037720870, now seen corresponding path program 1 times [2025-01-10 00:36:49,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:49,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67459088] [2025-01-10 00:36:49,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:49,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:49,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 00:36:49,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 00:36:49,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:49,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:51,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:51,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:51,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67459088] [2025-01-10 00:36:51,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67459088] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:51,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:51,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-10 00:36:51,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045463489] [2025-01-10 00:36:51,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:51,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 00:36:51,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:51,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 00:36:51,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-01-10 00:36:52,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 172 [2025-01-10 00:36:52,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 101 transitions, 252 flow. Second operand has 15 states, 15 states have (on average 92.66666666666667) internal successors, (1390), 15 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:52,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:52,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 172 [2025-01-10 00:36:52,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:52,753 INFO L124 PetriNetUnfolderBase]: 1711/3420 cut-off events. [2025-01-10 00:36:52,753 INFO L125 PetriNetUnfolderBase]: For 203/203 co-relation queries the response was YES. [2025-01-10 00:36:52,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6719 conditions, 3420 events. 1711/3420 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 18747 event pairs, 438 based on Foata normal form. 0/3216 useless extension candidates. Maximal degree in co-relation 6713. Up to 2065 conditions per place. [2025-01-10 00:36:52,763 INFO L140 encePairwiseOnDemand]: 157/172 looper letters, 129 selfloop transitions, 14 changer transitions 0/170 dead transitions. [2025-01-10 00:36:52,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 170 transitions, 686 flow [2025-01-10 00:36:52,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:36:52,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 00:36:52,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1323 transitions. [2025-01-10 00:36:52,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5916815742397138 [2025-01-10 00:36:52,766 INFO L175 Difference]: Start difference. First operand has 108 places, 101 transitions, 252 flow. Second operand 13 states and 1323 transitions. [2025-01-10 00:36:52,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 170 transitions, 686 flow [2025-01-10 00:36:52,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 170 transitions, 666 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-01-10 00:36:52,768 INFO L231 Difference]: Finished difference. Result has 110 places, 98 transitions, 260 flow [2025-01-10 00:36:52,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=260, PETRI_PLACES=110, PETRI_TRANSITIONS=98} [2025-01-10 00:36:52,769 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -52 predicate places. [2025-01-10 00:36:52,769 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 98 transitions, 260 flow [2025-01-10 00:36:52,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 92.66666666666667) internal successors, (1390), 15 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:52,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:52,771 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:36:52,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 00:36:52,771 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:52,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:52,771 INFO L85 PathProgramCache]: Analyzing trace with hash 345769896, now seen corresponding path program 1 times [2025-01-10 00:36:52,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:52,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376524257] [2025-01-10 00:36:52,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:52,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:52,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 00:36:52,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 00:36:52,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:52,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:53,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:53,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:53,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376524257] [2025-01-10 00:36:53,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376524257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:53,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:53,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 00:36:53,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507030852] [2025-01-10 00:36:53,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:53,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:36:53,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:53,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:36:53,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:36:54,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 172 [2025-01-10 00:36:54,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 98 transitions, 260 flow. Second operand has 11 states, 11 states have (on average 76.63636363636364) internal successors, (843), 11 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:54,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:54,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 172 [2025-01-10 00:36:54,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:55,330 INFO L124 PetriNetUnfolderBase]: 2375/4664 cut-off events. [2025-01-10 00:36:55,331 INFO L125 PetriNetUnfolderBase]: For 256/256 co-relation queries the response was YES. [2025-01-10 00:36:55,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9286 conditions, 4664 events. 2375/4664 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 27671 event pairs, 226 based on Foata normal form. 56/4467 useless extension candidates. Maximal degree in co-relation 9279. Up to 2173 conditions per place. [2025-01-10 00:36:55,354 INFO L140 encePairwiseOnDemand]: 157/172 looper letters, 154 selfloop transitions, 19 changer transitions 0/201 dead transitions. [2025-01-10 00:36:55,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 201 transitions, 851 flow [2025-01-10 00:36:55,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 00:36:55,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 00:36:55,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 982 transitions. [2025-01-10 00:36:55,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5190274841437632 [2025-01-10 00:36:55,357 INFO L175 Difference]: Start difference. First operand has 110 places, 98 transitions, 260 flow. Second operand 11 states and 982 transitions. [2025-01-10 00:36:55,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 201 transitions, 851 flow [2025-01-10 00:36:55,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 201 transitions, 827 flow, removed 0 selfloop flow, removed 11 redundant places. [2025-01-10 00:36:55,362 INFO L231 Difference]: Finished difference. Result has 113 places, 108 transitions, 346 flow [2025-01-10 00:36:55,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=346, PETRI_PLACES=113, PETRI_TRANSITIONS=108} [2025-01-10 00:36:55,362 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -49 predicate places. [2025-01-10 00:36:55,362 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 108 transitions, 346 flow [2025-01-10 00:36:55,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 76.63636363636364) internal successors, (843), 11 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:55,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:55,363 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:36:55,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 00:36:55,363 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:55,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:55,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1594326977, now seen corresponding path program 1 times [2025-01-10 00:36:55,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:55,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494959318] [2025-01-10 00:36:55,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:55,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:55,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 00:36:55,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 00:36:55,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:55,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:55,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:55,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:55,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494959318] [2025-01-10 00:36:55,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494959318] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:55,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:55,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:36:55,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748369937] [2025-01-10 00:36:55,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:55,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:36:55,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:55,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:36:55,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:36:55,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 172 [2025-01-10 00:36:55,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 108 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:55,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:55,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 172 [2025-01-10 00:36:55,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:55,955 INFO L124 PetriNetUnfolderBase]: 3330/7329 cut-off events. [2025-01-10 00:36:55,955 INFO L125 PetriNetUnfolderBase]: For 1674/1740 co-relation queries the response was YES. [2025-01-10 00:36:55,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14796 conditions, 7329 events. 3330/7329 cut-off events. For 1674/1740 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 54334 event pairs, 1490 based on Foata normal form. 183/6957 useless extension candidates. Maximal degree in co-relation 14785. Up to 3220 conditions per place. [2025-01-10 00:36:55,982 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 127 selfloop transitions, 2 changer transitions 0/167 dead transitions. [2025-01-10 00:36:55,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 167 transitions, 823 flow [2025-01-10 00:36:55,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:36:55,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:36:55,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2025-01-10 00:36:55,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7887596899224806 [2025-01-10 00:36:55,984 INFO L175 Difference]: Start difference. First operand has 113 places, 108 transitions, 346 flow. Second operand 3 states and 407 transitions. [2025-01-10 00:36:55,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 167 transitions, 823 flow [2025-01-10 00:36:55,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 167 transitions, 788 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-01-10 00:36:55,989 INFO L231 Difference]: Finished difference. Result has 111 places, 109 transitions, 338 flow [2025-01-10 00:36:55,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=338, PETRI_PLACES=111, PETRI_TRANSITIONS=109} [2025-01-10 00:36:55,989 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -51 predicate places. [2025-01-10 00:36:55,989 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 109 transitions, 338 flow [2025-01-10 00:36:55,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:55,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:55,990 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:36:55,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 00:36:55,990 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:55,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:55,990 INFO L85 PathProgramCache]: Analyzing trace with hash -2092598347, now seen corresponding path program 1 times [2025-01-10 00:36:55,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:55,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952520] [2025-01-10 00:36:55,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:55,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:56,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 00:36:56,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 00:36:56,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:56,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:56,163 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 00:36:56,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:56,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952520] [2025-01-10 00:36:56,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952520] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:56,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:56,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:36:56,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960471333] [2025-01-10 00:36:56,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:56,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:36:56,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:56,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:36:56,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:36:56,253 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 172 [2025-01-10 00:36:56,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 109 transitions, 338 flow. Second operand has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:56,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:56,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 172 [2025-01-10 00:36:56,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:56,949 INFO L124 PetriNetUnfolderBase]: 4187/8359 cut-off events. [2025-01-10 00:36:56,950 INFO L125 PetriNetUnfolderBase]: For 2335/2373 co-relation queries the response was YES. [2025-01-10 00:36:56,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18414 conditions, 8359 events. 4187/8359 cut-off events. For 2335/2373 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 58794 event pairs, 2277 based on Foata normal form. 92/7972 useless extension candidates. Maximal degree in co-relation 18401. Up to 5629 conditions per place. [2025-01-10 00:36:56,972 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 104 selfloop transitions, 3 changer transitions 0/144 dead transitions. [2025-01-10 00:36:56,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 144 transitions, 667 flow [2025-01-10 00:36:56,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:36:56,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:36:56,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2025-01-10 00:36:56,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7093023255813954 [2025-01-10 00:36:56,977 INFO L175 Difference]: Start difference. First operand has 111 places, 109 transitions, 338 flow. Second operand 4 states and 488 transitions. [2025-01-10 00:36:56,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 144 transitions, 667 flow [2025-01-10 00:36:56,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 144 transitions, 663 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:36:56,985 INFO L231 Difference]: Finished difference. Result has 114 places, 110 transitions, 352 flow [2025-01-10 00:36:56,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=352, PETRI_PLACES=114, PETRI_TRANSITIONS=110} [2025-01-10 00:36:56,986 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -48 predicate places. [2025-01-10 00:36:56,986 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 110 transitions, 352 flow [2025-01-10 00:36:56,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:56,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:56,990 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:36:56,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 00:36:56,991 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:56,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:56,991 INFO L85 PathProgramCache]: Analyzing trace with hash -196382674, now seen corresponding path program 1 times [2025-01-10 00:36:56,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:56,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146380575] [2025-01-10 00:36:56,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:56,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:57,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 00:36:57,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 00:36:57,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:57,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:57,066 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 00:36:57,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:57,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146380575] [2025-01-10 00:36:57,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146380575] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:57,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:57,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:36:57,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221422271] [2025-01-10 00:36:57,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:57,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:36:57,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:57,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:36:57,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:36:57,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 172 [2025-01-10 00:36:57,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 110 transitions, 352 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:57,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:57,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 172 [2025-01-10 00:36:57,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:57,403 INFO L124 PetriNetUnfolderBase]: 2481/5250 cut-off events. [2025-01-10 00:36:57,403 INFO L125 PetriNetUnfolderBase]: For 1237/1237 co-relation queries the response was YES. [2025-01-10 00:36:57,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11266 conditions, 5250 events. 2481/5250 cut-off events. For 1237/1237 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 33877 event pairs, 1218 based on Foata normal form. 124/5126 useless extension candidates. Maximal degree in co-relation 11252. Up to 2282 conditions per place. [2025-01-10 00:36:57,422 INFO L140 encePairwiseOnDemand]: 168/172 looper letters, 80 selfloop transitions, 3 changer transitions 0/119 dead transitions. [2025-01-10 00:36:57,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 119 transitions, 523 flow [2025-01-10 00:36:57,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:36:57,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:36:57,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2025-01-10 00:36:57,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7248062015503876 [2025-01-10 00:36:57,423 INFO L175 Difference]: Start difference. First operand has 114 places, 110 transitions, 352 flow. Second operand 3 states and 374 transitions. [2025-01-10 00:36:57,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 119 transitions, 523 flow [2025-01-10 00:36:57,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 119 transitions, 501 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-01-10 00:36:57,428 INFO L231 Difference]: Finished difference. Result has 111 places, 103 transitions, 304 flow [2025-01-10 00:36:57,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=304, PETRI_PLACES=111, PETRI_TRANSITIONS=103} [2025-01-10 00:36:57,428 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -51 predicate places. [2025-01-10 00:36:57,428 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 103 transitions, 304 flow [2025-01-10 00:36:57,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:57,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:57,429 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:36:57,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 00:36:57,429 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:57,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:57,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1484564480, now seen corresponding path program 1 times [2025-01-10 00:36:57,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:57,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056010213] [2025-01-10 00:36:57,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:57,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:57,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 00:36:57,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 00:36:57,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:57,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:57,583 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 00:36:57,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:57,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056010213] [2025-01-10 00:36:57,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056010213] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:57,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:57,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:36:57,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081260592] [2025-01-10 00:36:57,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:57,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:36:57,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:57,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:36:57,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:36:57,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 172 [2025-01-10 00:36:57,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 103 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:57,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:57,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 172 [2025-01-10 00:36:57,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:57,805 INFO L124 PetriNetUnfolderBase]: 1512/3602 cut-off events. [2025-01-10 00:36:57,805 INFO L125 PetriNetUnfolderBase]: For 1075/1075 co-relation queries the response was YES. [2025-01-10 00:36:57,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7826 conditions, 3602 events. 1512/3602 cut-off events. For 1075/1075 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 21547 event pairs, 368 based on Foata normal form. 218/3654 useless extension candidates. Maximal degree in co-relation 7813. Up to 1849 conditions per place. [2025-01-10 00:36:57,817 INFO L140 encePairwiseOnDemand]: 166/172 looper letters, 72 selfloop transitions, 6 changer transitions 0/116 dead transitions. [2025-01-10 00:36:57,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 116 transitions, 504 flow [2025-01-10 00:36:57,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:36:57,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:36:57,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2025-01-10 00:36:57,818 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7248062015503876 [2025-01-10 00:36:57,818 INFO L175 Difference]: Start difference. First operand has 111 places, 103 transitions, 304 flow. Second operand 3 states and 374 transitions. [2025-01-10 00:36:57,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 116 transitions, 504 flow [2025-01-10 00:36:57,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 116 transitions, 498 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:36:57,821 INFO L231 Difference]: Finished difference. Result has 111 places, 103 transitions, 310 flow [2025-01-10 00:36:57,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=111, PETRI_TRANSITIONS=103} [2025-01-10 00:36:57,821 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -51 predicate places. [2025-01-10 00:36:57,821 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 103 transitions, 310 flow [2025-01-10 00:36:57,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:57,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:57,822 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:36:57,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 00:36:57,822 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:57,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:57,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1233923724, now seen corresponding path program 1 times [2025-01-10 00:36:57,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:57,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131349234] [2025-01-10 00:36:57,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:57,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:57,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 00:36:57,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 00:36:57,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:57,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:58,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 00:36:58,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:58,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131349234] [2025-01-10 00:36:58,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131349234] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:58,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:58,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:36:58,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666971738] [2025-01-10 00:36:58,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:58,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:36:58,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:58,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:36:58,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:36:58,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 172 [2025-01-10 00:36:58,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 103 transitions, 310 flow. Second operand has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:58,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:58,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 172 [2025-01-10 00:36:58,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:58,389 INFO L124 PetriNetUnfolderBase]: 1512/3353 cut-off events. [2025-01-10 00:36:58,389 INFO L125 PetriNetUnfolderBase]: For 1228/1228 co-relation queries the response was YES. [2025-01-10 00:36:58,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7874 conditions, 3353 events. 1512/3353 cut-off events. For 1228/1228 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 18787 event pairs, 1021 based on Foata normal form. 126/3391 useless extension candidates. Maximal degree in co-relation 7861. Up to 2207 conditions per place. [2025-01-10 00:36:58,400 INFO L140 encePairwiseOnDemand]: 162/172 looper letters, 67 selfloop transitions, 3 changer transitions 0/101 dead transitions. [2025-01-10 00:36:58,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 101 transitions, 453 flow [2025-01-10 00:36:58,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:36:58,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:36:58,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 444 transitions. [2025-01-10 00:36:58,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6453488372093024 [2025-01-10 00:36:58,401 INFO L175 Difference]: Start difference. First operand has 111 places, 103 transitions, 310 flow. Second operand 4 states and 444 transitions. [2025-01-10 00:36:58,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 101 transitions, 453 flow [2025-01-10 00:36:58,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 101 transitions, 447 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:36:58,404 INFO L231 Difference]: Finished difference. Result has 106 places, 96 transitions, 296 flow [2025-01-10 00:36:58,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=296, PETRI_PLACES=106, PETRI_TRANSITIONS=96} [2025-01-10 00:36:58,404 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -56 predicate places. [2025-01-10 00:36:58,404 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 96 transitions, 296 flow [2025-01-10 00:36:58,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:58,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:58,405 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:36:58,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 00:36:58,405 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:58,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:58,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1189561317, now seen corresponding path program 1 times [2025-01-10 00:36:58,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:58,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098811356] [2025-01-10 00:36:58,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:58,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:58,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 00:36:58,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 00:36:58,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:58,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:58,489 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 00:36:58,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:58,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098811356] [2025-01-10 00:36:58,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098811356] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:36:58,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001851380] [2025-01-10 00:36:58,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:58,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:36:58,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:36:58,491 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:36:58,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 00:36:58,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 00:36:58,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 00:36:58,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:58,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:58,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 1951 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 00:36:58,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:36:58,899 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 00:36:58,899 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:36:58,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001851380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:58,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 00:36:58,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2025-01-10 00:36:58,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480391458] [2025-01-10 00:36:58,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:58,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:36:58,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:58,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:36:58,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:36:58,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 172 [2025-01-10 00:36:58,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 96 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:58,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:58,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 172 [2025-01-10 00:36:58,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:59,332 INFO L124 PetriNetUnfolderBase]: 1512/3356 cut-off events. [2025-01-10 00:36:59,332 INFO L125 PetriNetUnfolderBase]: For 1153/1153 co-relation queries the response was YES. [2025-01-10 00:36:59,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7761 conditions, 3356 events. 1512/3356 cut-off events. For 1153/1153 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 18835 event pairs, 1201 based on Foata normal form. 5/3259 useless extension candidates. Maximal degree in co-relation 7747. Up to 2625 conditions per place. [2025-01-10 00:36:59,352 INFO L140 encePairwiseOnDemand]: 170/172 looper letters, 63 selfloop transitions, 1 changer transitions 2/95 dead transitions. [2025-01-10 00:36:59,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 95 transitions, 424 flow [2025-01-10 00:36:59,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:36:59,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:36:59,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2025-01-10 00:36:59,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6937984496124031 [2025-01-10 00:36:59,358 INFO L175 Difference]: Start difference. First operand has 106 places, 96 transitions, 296 flow. Second operand 3 states and 358 transitions. [2025-01-10 00:36:59,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 95 transitions, 424 flow [2025-01-10 00:36:59,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 95 transitions, 418 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:36:59,361 INFO L231 Difference]: Finished difference. Result has 104 places, 93 transitions, 285 flow [2025-01-10 00:36:59,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=285, PETRI_PLACES=104, PETRI_TRANSITIONS=93} [2025-01-10 00:36:59,362 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -58 predicate places. [2025-01-10 00:36:59,362 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 93 transitions, 285 flow [2025-01-10 00:36:59,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:36:59,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:59,363 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:36:59,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 00:36:59,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-10 00:36:59,569 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-01-10 00:36:59,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:59,569 INFO L85 PathProgramCache]: Analyzing trace with hash 434237539, now seen corresponding path program 1 times [2025-01-10 00:36:59,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:59,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541086426] [2025-01-10 00:36:59,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:59,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:59,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 00:36:59,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 00:36:59,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:59,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:00,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 00:37:00,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:00,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541086426] [2025-01-10 00:37:00,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541086426] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:37:00,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702999906] [2025-01-10 00:37:00,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:00,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:37:00,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:37:00,877 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:37:00,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 00:37:00,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 00:37:01,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 00:37:01,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:01,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:01,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 2005 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-01-10 00:37:01,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:37:01,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-10 00:37:01,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-01-10 00:37:01,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2025-01-10 00:37:01,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:37:01,700 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 00:37:01,720 INFO L349 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2025-01-10 00:37:01,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 28 [2025-01-10 00:37:01,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:37:01,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:37:01,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2025-01-10 00:37:01,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:37:01,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 25 [2025-01-10 00:37:01,936 INFO L349 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2025-01-10 00:37:01,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 25 [2025-01-10 00:37:01,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:37:01,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2025-01-10 00:37:01,987 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:37:01,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:37:11,619 INFO L349 Elim1Store]: treesize reduction 106, result has 33.3 percent of original size [2025-01-10 00:37:11,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 511 treesize of output 491 [2025-01-10 00:37:11,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:37:11,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 215 treesize of output 207 [2025-01-10 00:37:11,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-10 00:37:11,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:37:11,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 132 treesize of output 136 [2025-01-10 00:37:11,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 00:37:11,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702999906] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:37:11,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:37:11,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 15] total 38 [2025-01-10 00:37:11,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837579609] [2025-01-10 00:37:11,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:37:11,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-10 00:37:11,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:11,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-10 00:37:11,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1266, Unknown=2, NotChecked=0, Total=1482 [2025-01-10 00:37:16,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 00:37:20,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 00:37:25,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 00:37:29,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 00:37:33,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 00:37:38,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 00:37:43,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 00:37:46,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.81s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 00:37:50,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]