./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c --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/weaver/popl20-bad-commit-1.wvr-bad.c -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 83c7202603a0719c5812e4d7043f4665de4d954c89c656bd6312ac9e8fdcb494 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:06:37,800 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:06:37,842 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 01:06:37,849 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:06:37,849 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:06:37,881 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:06:37,882 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:06:37,882 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:06:37,882 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:06:37,882 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:06:37,882 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:06:37,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:06:37,882 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:06:37,883 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:06:37,883 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:06:37,883 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:06:37,883 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:06:37,883 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:06:37,883 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:06:37,883 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:06:37,883 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:06:37,883 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:06:37,883 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:06:37,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:06:37,883 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:06:37,883 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:06:37,883 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:06:37,883 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:06:37,883 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:06:37,883 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:06:37,883 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:06:37,883 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:06:37,883 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:06:37,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:06:37,883 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:06:37,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:06:37,884 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:06:37,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:06:37,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:06:37,884 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:06:37,884 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:06:37,884 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:06:37,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:06:37,884 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:06:37,884 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:06:37,884 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:06:37,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:06:37,884 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 -> 83c7202603a0719c5812e4d7043f4665de4d954c89c656bd6312ac9e8fdcb494 [2025-01-10 01:06:38,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:06:38,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:06:38,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:06:38,114 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:06:38,114 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:06:38,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c [2025-01-10 01:06:39,324 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89ff748fc/7ac57b844b2f4fc1847173c4f9c752fe/FLAG67b628180 [2025-01-10 01:06:39,553 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:06:39,553 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c [2025-01-10 01:06:39,564 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89ff748fc/7ac57b844b2f4fc1847173c4f9c752fe/FLAG67b628180 [2025-01-10 01:06:39,890 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89ff748fc/7ac57b844b2f4fc1847173c4f9c752fe [2025-01-10 01:06:39,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:06:39,893 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:06:39,894 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:06:39,894 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:06:39,897 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:06:39,898 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:06:39" (1/1) ... [2025-01-10 01:06:39,898 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30c7e046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:39, skipping insertion in model container [2025-01-10 01:06:39,898 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:06:39" (1/1) ... [2025-01-10 01:06:39,926 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:06:40,098 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:06:40,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:06:40,115 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:06:40,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:06:40,169 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:06:40,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:40 WrapperNode [2025-01-10 01:06:40,169 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:06:40,170 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:06:40,170 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:06:40,170 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:06:40,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:40" (1/1) ... [2025-01-10 01:06:40,188 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:40" (1/1) ... [2025-01-10 01:06:40,207 INFO L138 Inliner]: procedures = 24, calls = 54, calls flagged for inlining = 21, calls inlined = 25, statements flattened = 327 [2025-01-10 01:06:40,210 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:06:40,210 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:06:40,211 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:06:40,211 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:06:40,217 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:40" (1/1) ... [2025-01-10 01:06:40,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:40" (1/1) ... [2025-01-10 01:06:40,226 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:40" (1/1) ... [2025-01-10 01:06:40,249 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-01-10 01:06:40,251 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:40" (1/1) ... [2025-01-10 01:06:40,251 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:40" (1/1) ... [2025-01-10 01:06:40,262 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:40" (1/1) ... [2025-01-10 01:06:40,266 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:40" (1/1) ... [2025-01-10 01:06:40,270 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:40" (1/1) ... [2025-01-10 01:06:40,275 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:40" (1/1) ... [2025-01-10 01:06:40,276 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:40" (1/1) ... [2025-01-10 01:06:40,281 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:06:40,282 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:06:40,282 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:06:40,282 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:06:40,283 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:40" (1/1) ... [2025-01-10 01:06:40,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:06:40,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:06:40,317 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 01:06:40,327 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 01:06:40,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:06:40,343 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:06:40,343 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:06:40,343 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:06:40,343 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:06:40,343 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:06:40,343 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:06:40,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:06:40,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:06:40,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:06:40,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:06:40,344 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 01:06:40,344 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 01:06:40,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:06:40,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:06:40,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:06:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:06:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:06:40,346 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 01:06:40,451 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:06:40,453 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:06:40,946 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:06:40,946 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:06:41,290 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:06:41,292 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-10 01:06:41,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:06:41 BoogieIcfgContainer [2025-01-10 01:06:41,293 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:06:41,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:06:41,295 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:06:41,299 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:06:41,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:06:39" (1/3) ... [2025-01-10 01:06:41,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69fc9787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:06:41, skipping insertion in model container [2025-01-10 01:06:41,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:40" (2/3) ... [2025-01-10 01:06:41,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69fc9787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:06:41, skipping insertion in model container [2025-01-10 01:06:41,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:06:41" (3/3) ... [2025-01-10 01:06:41,301 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-1.wvr-bad.c [2025-01-10 01:06:41,314 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:06:41,315 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-commit-1.wvr-bad.c that has 4 procedures, 72 locations, 1 initial locations, 6 loop locations, and 24 error locations. [2025-01-10 01:06:41,315 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:06:41,383 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 01:06:41,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 88 transitions, 197 flow [2025-01-10 01:06:41,504 INFO L124 PetriNetUnfolderBase]: 17/85 cut-off events. [2025-01-10 01:06:41,509 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:06:41,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 85 events. 17/85 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 257 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 64. Up to 6 conditions per place. [2025-01-10 01:06:41,517 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 88 transitions, 197 flow [2025-01-10 01:06:41,521 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 84 transitions, 186 flow [2025-01-10 01:06:41,529 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:06:41,540 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;@6546d50e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:06:41,541 INFO L334 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2025-01-10 01:06:41,543 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:06:41,544 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:06:41,544 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:06:41,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:41,544 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:06:41,545 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:06:41,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:41,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1021184, now seen corresponding path program 1 times [2025-01-10 01:06:41,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:41,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018324244] [2025-01-10 01:06:41,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:41,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:41,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:06:41,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:06:41,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:41,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:41,790 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 01:06:41,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:41,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018324244] [2025-01-10 01:06:41,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018324244] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:41,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:41,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:06:41,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710098690] [2025-01-10 01:06:41,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:41,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:06:41,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:41,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:06:41,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:06:41,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2025-01-10 01:06:41,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 84 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 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 01:06:41,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:41,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2025-01-10 01:06:41,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:42,907 INFO L124 PetriNetUnfolderBase]: 7255/10518 cut-off events. [2025-01-10 01:06:42,909 INFO L125 PetriNetUnfolderBase]: For 337/337 co-relation queries the response was YES. [2025-01-10 01:06:42,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20334 conditions, 10518 events. 7255/10518 cut-off events. For 337/337 co-relation queries the response was YES. Maximal size of possible extension queue 984. Compared 69504 event pairs, 5236 based on Foata normal form. 1/5700 useless extension candidates. Maximal degree in co-relation 19646. Up to 9450 conditions per place. [2025-01-10 01:06:42,989 INFO L140 encePairwiseOnDemand]: 79/88 looper letters, 54 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2025-01-10 01:06:42,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 76 transitions, 282 flow [2025-01-10 01:06:42,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:06:42,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:06:43,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2025-01-10 01:06:43,002 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2025-01-10 01:06:43,004 INFO L175 Difference]: Start difference. First operand has 77 places, 84 transitions, 186 flow. Second operand 3 states and 135 transitions. [2025-01-10 01:06:43,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 76 transitions, 282 flow [2025-01-10 01:06:43,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 76 transitions, 270 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:06:43,019 INFO L231 Difference]: Finished difference. Result has 68 places, 76 transitions, 162 flow [2025-01-10 01:06:43,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=68, PETRI_TRANSITIONS=76} [2025-01-10 01:06:43,025 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -9 predicate places. [2025-01-10 01:06:43,025 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 76 transitions, 162 flow [2025-01-10 01:06:43,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 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 01:06:43,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:43,026 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:06:43,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:06:43,027 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:06:43,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:43,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1021185, now seen corresponding path program 1 times [2025-01-10 01:06:43,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:43,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699541633] [2025-01-10 01:06:43,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:43,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:43,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:06:43,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:06:43,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:43,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:43,307 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 01:06:43,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:43,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699541633] [2025-01-10 01:06:43,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699541633] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:43,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:43,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:06:43,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842979] [2025-01-10 01:06:43,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:43,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:06:43,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:43,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:06:43,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:06:43,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2025-01-10 01:06:43,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 76 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 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 01:06:43,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:43,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2025-01-10 01:06:43,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:44,269 INFO L124 PetriNetUnfolderBase]: 7258/10527 cut-off events. [2025-01-10 01:06:44,269 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-01-10 01:06:44,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20134 conditions, 10527 events. 7258/10527 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 984. Compared 69486 event pairs, 5236 based on Foata normal form. 0/5704 useless extension candidates. Maximal degree in co-relation 20084. Up to 9463 conditions per place. [2025-01-10 01:06:44,327 INFO L140 encePairwiseOnDemand]: 75/88 looper letters, 58 selfloop transitions, 10 changer transitions 0/85 dead transitions. [2025-01-10 01:06:44,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 85 transitions, 318 flow [2025-01-10 01:06:44,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:06:44,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:06:44,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2025-01-10 01:06:44,329 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4744318181818182 [2025-01-10 01:06:44,329 INFO L175 Difference]: Start difference. First operand has 68 places, 76 transitions, 162 flow. Second operand 4 states and 167 transitions. [2025-01-10 01:06:44,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 85 transitions, 318 flow [2025-01-10 01:06:44,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 85 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:06:44,332 INFO L231 Difference]: Finished difference. Result has 72 places, 85 transitions, 240 flow [2025-01-10 01:06:44,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=72, PETRI_TRANSITIONS=85} [2025-01-10 01:06:44,333 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -5 predicate places. [2025-01-10 01:06:44,333 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 85 transitions, 240 flow [2025-01-10 01:06:44,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 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 01:06:44,333 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:44,333 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:06:44,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:06:44,333 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:06:44,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:44,334 INFO L85 PathProgramCache]: Analyzing trace with hash 981392062, now seen corresponding path program 1 times [2025-01-10 01:06:44,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:44,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619833899] [2025-01-10 01:06:44,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:44,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:44,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:06:44,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:06:44,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:44,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:44,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:06:44,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:44,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619833899] [2025-01-10 01:06:44,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619833899] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:06:44,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571207836] [2025-01-10 01:06:44,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:44,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:06:44,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:06:44,680 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 01:06:44,681 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 01:06:44,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:06:44,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:06:44,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:44,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:44,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:06:44,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:06:44,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-01-10 01:06:45,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:06:45,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:06:45,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:06:45,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571207836] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:06:45,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:06:45,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:06:45,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49895653] [2025-01-10 01:06:45,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:06:45,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:06:45,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:45,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:06:45,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:06:45,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2025-01-10 01:06:45,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 85 transitions, 240 flow. Second operand has 11 states, 11 states have (on average 25.363636363636363) internal successors, (279), 11 states have internal predecessors, (279), 0 states have call successors, (0), 0 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 01:06:45,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:45,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2025-01-10 01:06:45,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:46,451 INFO L124 PetriNetUnfolderBase]: 7258/10524 cut-off events. [2025-01-10 01:06:46,451 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-01-10 01:06:46,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20156 conditions, 10524 events. 7258/10524 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 984. Compared 69487 event pairs, 5236 based on Foata normal form. 0/5707 useless extension candidates. Maximal degree in co-relation 20098. Up to 9451 conditions per place. [2025-01-10 01:06:46,503 INFO L140 encePairwiseOnDemand]: 75/88 looper letters, 48 selfloop transitions, 17 changer transitions 0/82 dead transitions. [2025-01-10 01:06:46,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 82 transitions, 358 flow [2025-01-10 01:06:46,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:06:46,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:06:46,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions. [2025-01-10 01:06:46,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4015151515151515 [2025-01-10 01:06:46,505 INFO L175 Difference]: Start difference. First operand has 72 places, 85 transitions, 240 flow. Second operand 6 states and 212 transitions. [2025-01-10 01:06:46,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 82 transitions, 358 flow [2025-01-10 01:06:46,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 82 transitions, 358 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 01:06:46,507 INFO L231 Difference]: Finished difference. Result has 74 places, 82 transitions, 262 flow [2025-01-10 01:06:46,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=262, PETRI_PLACES=74, PETRI_TRANSITIONS=82} [2025-01-10 01:06:46,508 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -3 predicate places. [2025-01-10 01:06:46,508 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 82 transitions, 262 flow [2025-01-10 01:06:46,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 25.363636363636363) internal successors, (279), 11 states have internal predecessors, (279), 0 states have call successors, (0), 0 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 01:06:46,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:46,508 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:46,520 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 01:06:46,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:06:46,713 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:06:46,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:46,714 INFO L85 PathProgramCache]: Analyzing trace with hash 704101056, now seen corresponding path program 1 times [2025-01-10 01:06:46,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:46,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723639110] [2025-01-10 01:06:46,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:46,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:46,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:06:46,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:06:46,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:46,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:46,797 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 01:06:46,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:46,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723639110] [2025-01-10 01:06:46,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723639110] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:46,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:46,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:06:46,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655446722] [2025-01-10 01:06:46,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:46,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:06:46,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:46,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:06:46,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:06:46,799 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2025-01-10 01:06:46,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 82 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 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 01:06:46,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:46,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2025-01-10 01:06:46,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:47,620 INFO L124 PetriNetUnfolderBase]: 12109/17626 cut-off events. [2025-01-10 01:06:47,620 INFO L125 PetriNetUnfolderBase]: For 169/169 co-relation queries the response was YES. [2025-01-10 01:06:47,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33726 conditions, 17626 events. 12109/17626 cut-off events. For 169/169 co-relation queries the response was YES. Maximal size of possible extension queue 1338. Compared 122214 event pairs, 4256 based on Foata normal form. 356/10124 useless extension candidates. Maximal degree in co-relation 33652. Up to 9751 conditions per place. [2025-01-10 01:06:47,817 INFO L140 encePairwiseOnDemand]: 79/88 looper letters, 99 selfloop transitions, 3 changer transitions 0/119 dead transitions. [2025-01-10 01:06:47,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 119 transitions, 544 flow [2025-01-10 01:06:47,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:06:47,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:06:47,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2025-01-10 01:06:47,820 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2025-01-10 01:06:47,820 INFO L175 Difference]: Start difference. First operand has 74 places, 82 transitions, 262 flow. Second operand 3 states and 180 transitions. [2025-01-10 01:06:47,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 119 transitions, 544 flow [2025-01-10 01:06:47,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 119 transitions, 494 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-01-10 01:06:47,823 INFO L231 Difference]: Finished difference. Result has 71 places, 84 transitions, 241 flow [2025-01-10 01:06:47,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=241, PETRI_PLACES=71, PETRI_TRANSITIONS=84} [2025-01-10 01:06:47,825 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -6 predicate places. [2025-01-10 01:06:47,826 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 84 transitions, 241 flow [2025-01-10 01:06:47,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 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 01:06:47,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:47,826 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:47,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:06:47,827 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:06:47,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:47,827 INFO L85 PathProgramCache]: Analyzing trace with hash 352298363, now seen corresponding path program 1 times [2025-01-10 01:06:47,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:47,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020738020] [2025-01-10 01:06:47,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:47,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:47,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:06:47,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:06:47,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:47,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:47,874 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 01:06:47,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:47,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020738020] [2025-01-10 01:06:47,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020738020] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:47,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:47,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:06:47,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751492715] [2025-01-10 01:06:47,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:47,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:06:47,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:47,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:06:47,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:06:47,888 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 88 [2025-01-10 01:06:47,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 84 transitions, 241 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 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 01:06:47,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:47,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 88 [2025-01-10 01:06:47,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:49,132 INFO L124 PetriNetUnfolderBase]: 15258/21862 cut-off events. [2025-01-10 01:06:49,132 INFO L125 PetriNetUnfolderBase]: For 1276/1300 co-relation queries the response was YES. [2025-01-10 01:06:49,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45000 conditions, 21862 events. 15258/21862 cut-off events. For 1276/1300 co-relation queries the response was YES. Maximal size of possible extension queue 885. Compared 138252 event pairs, 5655 based on Foata normal form. 0/14477 useless extension candidates. Maximal degree in co-relation 8260. Up to 10528 conditions per place. [2025-01-10 01:06:49,257 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 100 selfloop transitions, 4 changer transitions 0/116 dead transitions. [2025-01-10 01:06:49,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 116 transitions, 521 flow [2025-01-10 01:06:49,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:06:49,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:06:49,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2025-01-10 01:06:49,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-01-10 01:06:49,260 INFO L175 Difference]: Start difference. First operand has 71 places, 84 transitions, 241 flow. Second operand 3 states and 160 transitions. [2025-01-10 01:06:49,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 116 transitions, 521 flow [2025-01-10 01:06:49,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 116 transitions, 518 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:06:49,264 INFO L231 Difference]: Finished difference. Result has 74 places, 85 transitions, 260 flow [2025-01-10 01:06:49,264 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=74, PETRI_TRANSITIONS=85} [2025-01-10 01:06:49,264 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -3 predicate places. [2025-01-10 01:06:49,264 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 85 transitions, 260 flow [2025-01-10 01:06:49,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 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 01:06:49,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:49,265 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:49,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:06:49,265 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:06:49,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:49,265 INFO L85 PathProgramCache]: Analyzing trace with hash -81230963, now seen corresponding path program 1 times [2025-01-10 01:06:49,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:49,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450969124] [2025-01-10 01:06:49,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:49,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:49,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:06:49,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:06:49,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:49,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:49,346 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 01:06:49,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:49,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450969124] [2025-01-10 01:06:49,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450969124] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:49,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:49,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:06:49,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700621824] [2025-01-10 01:06:49,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:49,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:06:49,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:49,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:06:49,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:06:49,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2025-01-10 01:06:49,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 85 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 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 01:06:49,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:49,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2025-01-10 01:06:49,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:50,821 INFO L124 PetriNetUnfolderBase]: 19157/28493 cut-off events. [2025-01-10 01:06:50,821 INFO L125 PetriNetUnfolderBase]: For 4804/4968 co-relation queries the response was YES. [2025-01-10 01:06:50,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60753 conditions, 28493 events. 19157/28493 cut-off events. For 4804/4968 co-relation queries the response was YES. Maximal size of possible extension queue 1044. Compared 195128 event pairs, 7868 based on Foata normal form. 482/19466 useless extension candidates. Maximal degree in co-relation 13786. Up to 12927 conditions per place. [2025-01-10 01:06:50,990 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 105 selfloop transitions, 2 changer transitions 0/125 dead transitions. [2025-01-10 01:06:50,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 125 transitions, 582 flow [2025-01-10 01:06:50,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:06:50,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:06:50,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2025-01-10 01:06:50,997 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2025-01-10 01:06:50,997 INFO L175 Difference]: Start difference. First operand has 74 places, 85 transitions, 260 flow. Second operand 3 states and 180 transitions. [2025-01-10 01:06:50,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 125 transitions, 582 flow [2025-01-10 01:06:51,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 125 transitions, 570 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:06:51,018 INFO L231 Difference]: Finished difference. Result has 75 places, 86 transitions, 268 flow [2025-01-10 01:06:51,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=75, PETRI_TRANSITIONS=86} [2025-01-10 01:06:51,023 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -2 predicate places. [2025-01-10 01:06:51,023 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 86 transitions, 268 flow [2025-01-10 01:06:51,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 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 01:06:51,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:51,023 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:51,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:06:51,024 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:06:51,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:51,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1776809576, now seen corresponding path program 1 times [2025-01-10 01:06:51,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:51,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182385149] [2025-01-10 01:06:51,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:51,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:51,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:06:51,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:06:51,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:51,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:51,101 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 01:06:51,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:51,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182385149] [2025-01-10 01:06:51,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182385149] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:51,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:51,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:06:51,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684506018] [2025-01-10 01:06:51,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:51,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:06:51,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:51,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:06:51,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:06:51,113 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2025-01-10 01:06:51,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 86 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:06:51,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:51,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2025-01-10 01:06:51,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:52,751 INFO L124 PetriNetUnfolderBase]: 23770/34271 cut-off events. [2025-01-10 01:06:52,752 INFO L125 PetriNetUnfolderBase]: For 4421/4835 co-relation queries the response was YES. [2025-01-10 01:06:52,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73063 conditions, 34271 events. 23770/34271 cut-off events. For 4421/4835 co-relation queries the response was YES. Maximal size of possible extension queue 1503. Compared 225597 event pairs, 11883 based on Foata normal form. 0/23391 useless extension candidates. Maximal degree in co-relation 22444. Up to 20204 conditions per place. [2025-01-10 01:06:52,918 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 102 selfloop transitions, 4 changer transitions 0/121 dead transitions. [2025-01-10 01:06:52,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 121 transitions, 571 flow [2025-01-10 01:06:52,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:06:52,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:06:52,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2025-01-10 01:06:52,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-01-10 01:06:52,919 INFO L175 Difference]: Start difference. First operand has 75 places, 86 transitions, 268 flow. Second operand 3 states and 168 transitions. [2025-01-10 01:06:52,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 121 transitions, 571 flow [2025-01-10 01:06:52,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 121 transitions, 569 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:06:52,924 INFO L231 Difference]: Finished difference. Result has 78 places, 86 transitions, 284 flow [2025-01-10 01:06:52,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=284, PETRI_PLACES=78, PETRI_TRANSITIONS=86} [2025-01-10 01:06:52,924 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 1 predicate places. [2025-01-10 01:06:52,924 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 86 transitions, 284 flow [2025-01-10 01:06:52,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:06:52,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:52,925 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:52,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:06:52,925 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:06:52,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:52,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1250540606, now seen corresponding path program 1 times [2025-01-10 01:06:52,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:52,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366017706] [2025-01-10 01:06:52,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:52,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:52,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:06:52,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:06:52,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:52,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:53,005 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 01:06:53,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:53,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366017706] [2025-01-10 01:06:53,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366017706] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:53,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:53,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:06:53,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822197414] [2025-01-10 01:06:53,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:53,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:06:53,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:53,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:06:53,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:06:53,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2025-01-10 01:06:53,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 86 transitions, 284 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 01:06:53,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:53,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2025-01-10 01:06:53,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:54,759 INFO L124 PetriNetUnfolderBase]: 21339/31713 cut-off events. [2025-01-10 01:06:54,759 INFO L125 PetriNetUnfolderBase]: For 10203/10905 co-relation queries the response was YES. [2025-01-10 01:06:54,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70169 conditions, 31713 events. 21339/31713 cut-off events. For 10203/10905 co-relation queries the response was YES. Maximal size of possible extension queue 1391. Compared 214305 event pairs, 16426 based on Foata normal form. 112/21797 useless extension candidates. Maximal degree in co-relation 42105. Up to 26821 conditions per place. [2025-01-10 01:06:54,911 INFO L140 encePairwiseOnDemand]: 78/88 looper letters, 97 selfloop transitions, 7 changer transitions 0/123 dead transitions. [2025-01-10 01:06:54,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 123 transitions, 598 flow [2025-01-10 01:06:54,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:06:54,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:06:54,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 234 transitions. [2025-01-10 01:06:54,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5318181818181819 [2025-01-10 01:06:54,913 INFO L175 Difference]: Start difference. First operand has 78 places, 86 transitions, 284 flow. Second operand 5 states and 234 transitions. [2025-01-10 01:06:54,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 123 transitions, 598 flow [2025-01-10 01:06:54,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 123 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:06:54,924 INFO L231 Difference]: Finished difference. Result has 82 places, 90 transitions, 332 flow [2025-01-10 01:06:54,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=332, PETRI_PLACES=82, PETRI_TRANSITIONS=90} [2025-01-10 01:06:54,927 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 5 predicate places. [2025-01-10 01:06:54,927 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 90 transitions, 332 flow [2025-01-10 01:06:54,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 01:06:54,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:54,927 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:54,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:06:54,928 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:06:54,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:54,928 INFO L85 PathProgramCache]: Analyzing trace with hash 112055269, now seen corresponding path program 1 times [2025-01-10 01:06:54,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:54,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179295614] [2025-01-10 01:06:54,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:54,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:54,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:06:54,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:06:54,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:54,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:54,966 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 01:06:54,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:54,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179295614] [2025-01-10 01:06:54,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179295614] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:54,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:54,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:06:54,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776154732] [2025-01-10 01:06:54,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:54,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:06:54,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:54,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:06:54,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:06:54,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2025-01-10 01:06:54,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 90 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:06:54,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:54,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2025-01-10 01:06:54,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:58,791 INFO L124 PetriNetUnfolderBase]: 37219/53365 cut-off events. [2025-01-10 01:06:58,792 INFO L125 PetriNetUnfolderBase]: For 13198/14382 co-relation queries the response was YES. [2025-01-10 01:06:58,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119821 conditions, 53365 events. 37219/53365 cut-off events. For 13198/14382 co-relation queries the response was YES. Maximal size of possible extension queue 2200. Compared 357531 event pairs, 21948 based on Foata normal form. 0/36558 useless extension candidates. Maximal degree in co-relation 117451. Up to 24971 conditions per place. [2025-01-10 01:06:59,116 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 106 selfloop transitions, 5 changer transitions 0/127 dead transitions. [2025-01-10 01:06:59,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 127 transitions, 663 flow [2025-01-10 01:06:59,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:06:59,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:06:59,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2025-01-10 01:06:59,121 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-01-10 01:06:59,121 INFO L175 Difference]: Start difference. First operand has 82 places, 90 transitions, 332 flow. Second operand 3 states and 168 transitions. [2025-01-10 01:06:59,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 127 transitions, 663 flow [2025-01-10 01:06:59,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 127 transitions, 659 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 01:06:59,130 INFO L231 Difference]: Finished difference. Result has 85 places, 91 transitions, 354 flow [2025-01-10 01:06:59,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=354, PETRI_PLACES=85, PETRI_TRANSITIONS=91} [2025-01-10 01:06:59,132 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 8 predicate places. [2025-01-10 01:06:59,132 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 91 transitions, 354 flow [2025-01-10 01:06:59,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:06:59,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:59,132 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:59,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:06:59,132 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:06:59,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:59,137 INFO L85 PathProgramCache]: Analyzing trace with hash 389986747, now seen corresponding path program 1 times [2025-01-10 01:06:59,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:59,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920102699] [2025-01-10 01:06:59,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:59,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:59,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:06:59,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:06:59,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:59,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:59,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:06:59,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:59,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920102699] [2025-01-10 01:06:59,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920102699] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:59,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:59,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:06:59,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307481374] [2025-01-10 01:06:59,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:59,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:06:59,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:59,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:06:59,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:06:59,385 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2025-01-10 01:06:59,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 91 transitions, 354 flow. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:06:59,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:59,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2025-01-10 01:06:59,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:01,676 INFO L124 PetriNetUnfolderBase]: 24142/36396 cut-off events. [2025-01-10 01:07:01,676 INFO L125 PetriNetUnfolderBase]: For 15318/16802 co-relation queries the response was YES. [2025-01-10 01:07:01,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82480 conditions, 36396 events. 24142/36396 cut-off events. For 15318/16802 co-relation queries the response was YES. Maximal size of possible extension queue 1384. Compared 255023 event pairs, 19281 based on Foata normal form. 0/26994 useless extension candidates. Maximal degree in co-relation 80302. Up to 32003 conditions per place. [2025-01-10 01:07:01,908 INFO L140 encePairwiseOnDemand]: 81/88 looper letters, 61 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2025-01-10 01:07:01,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 87 transitions, 474 flow [2025-01-10 01:07:01,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:07:01,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:07:01,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2025-01-10 01:07:01,910 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-01-10 01:07:01,911 INFO L175 Difference]: Start difference. First operand has 85 places, 91 transitions, 354 flow. Second operand 5 states and 176 transitions. [2025-01-10 01:07:01,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 87 transitions, 474 flow [2025-01-10 01:07:01,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 87 transitions, 464 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:07:01,920 INFO L231 Difference]: Finished difference. Result has 83 places, 87 transitions, 342 flow [2025-01-10 01:07:01,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=342, PETRI_PLACES=83, PETRI_TRANSITIONS=87} [2025-01-10 01:07:01,921 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 6 predicate places. [2025-01-10 01:07:01,922 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 87 transitions, 342 flow [2025-01-10 01:07:01,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:01,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:01,922 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:01,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:07:01,922 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:07:01,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:01,923 INFO L85 PathProgramCache]: Analyzing trace with hash 389986748, now seen corresponding path program 1 times [2025-01-10 01:07:01,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:01,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254770834] [2025-01-10 01:07:01,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:01,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:01,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:07:01,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:07:01,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:01,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:02,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:07:02,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:02,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254770834] [2025-01-10 01:07:02,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254770834] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:02,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104199791] [2025-01-10 01:07:02,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:02,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:02,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:02,489 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 01:07:02,495 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 01:07:02,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:07:02,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:07:02,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:02,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:02,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 01:07:02,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:02,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:07:02,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:07:02,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2025-01-10 01:07:02,662 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 01:07:02,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-10 01:07:02,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:07:02,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2025-01-10 01:07:02,688 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:07:02,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:07:02,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:07:02,725 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:07:02,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104199791] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:02,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:07:02,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-01-10 01:07:02,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302417476] [2025-01-10 01:07:02,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:02,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:07:02,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:02,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:07:02,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:07:02,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2025-01-10 01:07:02,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 87 transitions, 342 flow. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:02,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:02,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2025-01-10 01:07:02,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:04,848 INFO L124 PetriNetUnfolderBase]: 18925/28895 cut-off events. [2025-01-10 01:07:04,848 INFO L125 PetriNetUnfolderBase]: For 9418/10666 co-relation queries the response was YES. [2025-01-10 01:07:04,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63240 conditions, 28895 events. 18925/28895 cut-off events. For 9418/10666 co-relation queries the response was YES. Maximal size of possible extension queue 1013. Compared 197153 event pairs, 14916 based on Foata normal form. 1455/22659 useless extension candidates. Maximal degree in co-relation 61056. Up to 25022 conditions per place. [2025-01-10 01:07:04,976 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 60 selfloop transitions, 3 changer transitions 0/83 dead transitions. [2025-01-10 01:07:04,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 83 transitions, 454 flow [2025-01-10 01:07:04,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:07:04,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:07:04,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2025-01-10 01:07:04,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2025-01-10 01:07:04,978 INFO L175 Difference]: Start difference. First operand has 83 places, 87 transitions, 342 flow. Second operand 4 states and 148 transitions. [2025-01-10 01:07:04,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 83 transitions, 454 flow [2025-01-10 01:07:04,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 83 transitions, 445 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:07:04,985 INFO L231 Difference]: Finished difference. Result has 79 places, 83 transitions, 325 flow [2025-01-10 01:07:04,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=325, PETRI_PLACES=79, PETRI_TRANSITIONS=83} [2025-01-10 01:07:04,986 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 2 predicate places. [2025-01-10 01:07:04,987 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 83 transitions, 325 flow [2025-01-10 01:07:04,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:04,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:04,987 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:04,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:07:05,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:05,188 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:07:05,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:05,188 INFO L85 PathProgramCache]: Analyzing trace with hash -266508606, now seen corresponding path program 1 times [2025-01-10 01:07:05,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:05,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625505099] [2025-01-10 01:07:05,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:05,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:05,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:07:05,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:07:05,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:05,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:05,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:07:05,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:05,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625505099] [2025-01-10 01:07:05,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625505099] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:05,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:05,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:07:05,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65577051] [2025-01-10 01:07:05,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:05,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:07:05,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:05,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:07:05,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:07:05,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2025-01-10 01:07:05,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 83 transitions, 325 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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 01:07:05,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:05,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2025-01-10 01:07:05,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:07,593 INFO L124 PetriNetUnfolderBase]: 24421/36136 cut-off events. [2025-01-10 01:07:07,594 INFO L125 PetriNetUnfolderBase]: For 13779/16060 co-relation queries the response was YES. [2025-01-10 01:07:07,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81524 conditions, 36136 events. 24421/36136 cut-off events. For 13779/16060 co-relation queries the response was YES. Maximal size of possible extension queue 1045. Compared 232476 event pairs, 8589 based on Foata normal form. 732/28079 useless extension candidates. Maximal degree in co-relation 79381. Up to 23607 conditions per place. [2025-01-10 01:07:07,797 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 92 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2025-01-10 01:07:07,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 114 transitions, 606 flow [2025-01-10 01:07:07,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:07:07,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:07:07,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2025-01-10 01:07:07,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2025-01-10 01:07:07,801 INFO L175 Difference]: Start difference. First operand has 79 places, 83 transitions, 325 flow. Second operand 3 states and 162 transitions. [2025-01-10 01:07:07,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 114 transitions, 606 flow [2025-01-10 01:07:07,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 114 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:07:07,809 INFO L231 Difference]: Finished difference. Result has 80 places, 84 transitions, 339 flow [2025-01-10 01:07:07,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=339, PETRI_PLACES=80, PETRI_TRANSITIONS=84} [2025-01-10 01:07:07,810 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 3 predicate places. [2025-01-10 01:07:07,810 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 84 transitions, 339 flow [2025-01-10 01:07:07,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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 01:07:07,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:07,810 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:07,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:07:07,810 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:07:07,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:07,811 INFO L85 PathProgramCache]: Analyzing trace with hash -78806120, now seen corresponding path program 1 times [2025-01-10 01:07:07,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:07,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774138103] [2025-01-10 01:07:07,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:07,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:07,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:07:07,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:07:07,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:07,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:07,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:07:07,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:07,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774138103] [2025-01-10 01:07:07,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774138103] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:07,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:07,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:07:07,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314069390] [2025-01-10 01:07:07,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:07,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:07:07,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:07,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:07:07,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:07:07,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2025-01-10 01:07:07,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 84 transitions, 339 flow. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:07,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:07,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2025-01-10 01:07:07,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:10,038 INFO L124 PetriNetUnfolderBase]: 21299/31961 cut-off events. [2025-01-10 01:07:10,038 INFO L125 PetriNetUnfolderBase]: For 14747/16772 co-relation queries the response was YES. [2025-01-10 01:07:10,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73637 conditions, 31961 events. 21299/31961 cut-off events. For 14747/16772 co-relation queries the response was YES. Maximal size of possible extension queue 959. Compared 208966 event pairs, 16751 based on Foata normal form. 0/25144 useless extension candidates. Maximal degree in co-relation 71493. Up to 28538 conditions per place. [2025-01-10 01:07:10,202 INFO L140 encePairwiseOnDemand]: 84/88 looper letters, 58 selfloop transitions, 4 changer transitions 0/82 dead transitions. [2025-01-10 01:07:10,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 82 transitions, 457 flow [2025-01-10 01:07:10,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:07:10,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:07:10,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2025-01-10 01:07:10,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-01-10 01:07:10,204 INFO L175 Difference]: Start difference. First operand has 80 places, 84 transitions, 339 flow. Second operand 4 states and 144 transitions. [2025-01-10 01:07:10,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 82 transitions, 457 flow [2025-01-10 01:07:10,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 82 transitions, 455 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:07:10,210 INFO L231 Difference]: Finished difference. Result has 80 places, 82 transitions, 339 flow [2025-01-10 01:07:10,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=339, PETRI_PLACES=80, PETRI_TRANSITIONS=82} [2025-01-10 01:07:10,211 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 3 predicate places. [2025-01-10 01:07:10,211 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 82 transitions, 339 flow [2025-01-10 01:07:10,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:10,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:10,211 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:10,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:07:10,211 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:07:10,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:10,212 INFO L85 PathProgramCache]: Analyzing trace with hash -78806119, now seen corresponding path program 1 times [2025-01-10 01:07:10,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:10,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971677844] [2025-01-10 01:07:10,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:10,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:10,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:07:10,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:07:10,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:10,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:10,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:07:10,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:10,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971677844] [2025-01-10 01:07:10,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971677844] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:10,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:10,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:07:10,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135552801] [2025-01-10 01:07:10,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:10,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:07:10,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:10,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:07:10,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:07:10,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2025-01-10 01:07:10,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 82 transitions, 339 flow. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:10,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:10,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2025-01-10 01:07:10,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:13,187 INFO L124 PetriNetUnfolderBase]: 28153/42871 cut-off events. [2025-01-10 01:07:13,187 INFO L125 PetriNetUnfolderBase]: For 17881/20344 co-relation queries the response was YES. [2025-01-10 01:07:13,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97094 conditions, 42871 events. 28153/42871 cut-off events. For 17881/20344 co-relation queries the response was YES. Maximal size of possible extension queue 1097. Compared 292164 event pairs, 22671 based on Foata normal form. 340/33935 useless extension candidates. Maximal degree in co-relation 92891. Up to 28543 conditions per place. [2025-01-10 01:07:13,408 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 87 selfloop transitions, 8 changer transitions 0/115 dead transitions. [2025-01-10 01:07:13,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 115 transitions, 633 flow [2025-01-10 01:07:13,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:07:13,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:07:13,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2025-01-10 01:07:13,410 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5397727272727273 [2025-01-10 01:07:13,410 INFO L175 Difference]: Start difference. First operand has 80 places, 82 transitions, 339 flow. Second operand 4 states and 190 transitions. [2025-01-10 01:07:13,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 115 transitions, 633 flow [2025-01-10 01:07:13,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 115 transitions, 628 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:07:13,418 INFO L231 Difference]: Finished difference. Result has 82 places, 82 transitions, 360 flow [2025-01-10 01:07:13,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=360, PETRI_PLACES=82, PETRI_TRANSITIONS=82} [2025-01-10 01:07:13,420 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 5 predicate places. [2025-01-10 01:07:13,420 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 82 transitions, 360 flow [2025-01-10 01:07:13,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:13,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:13,421 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:13,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 01:07:13,421 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:07:13,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:13,422 INFO L85 PathProgramCache]: Analyzing trace with hash -392771774, now seen corresponding path program 1 times [2025-01-10 01:07:13,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:13,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208413647] [2025-01-10 01:07:13,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:13,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:13,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:07:13,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:07:13,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:13,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:13,481 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 01:07:13,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:13,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208413647] [2025-01-10 01:07:13,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208413647] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:13,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:13,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:07:13,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824550363] [2025-01-10 01:07:13,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:13,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:07:13,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:13,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:07:13,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:07:13,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2025-01-10 01:07:13,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 82 transitions, 360 flow. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 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 01:07:13,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:13,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2025-01-10 01:07:13,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:16,054 INFO L124 PetriNetUnfolderBase]: 28153/42859 cut-off events. [2025-01-10 01:07:16,054 INFO L125 PetriNetUnfolderBase]: For 18597/21060 co-relation queries the response was YES. [2025-01-10 01:07:16,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97803 conditions, 42859 events. 28153/42859 cut-off events. For 18597/21060 co-relation queries the response was YES. Maximal size of possible extension queue 1077. Compared 288497 event pairs, 9976 based on Foata normal form. 6/33587 useless extension candidates. Maximal degree in co-relation 93599. Up to 32505 conditions per place. [2025-01-10 01:07:16,308 INFO L140 encePairwiseOnDemand]: 85/88 looper letters, 69 selfloop transitions, 2 changer transitions 9/100 dead transitions. [2025-01-10 01:07:16,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 100 transitions, 567 flow [2025-01-10 01:07:16,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:07:16,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:07:16,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2025-01-10 01:07:16,310 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.553030303030303 [2025-01-10 01:07:16,310 INFO L175 Difference]: Start difference. First operand has 82 places, 82 transitions, 360 flow. Second operand 3 states and 146 transitions. [2025-01-10 01:07:16,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 100 transitions, 567 flow [2025-01-10 01:07:16,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 100 transitions, 558 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:07:16,319 INFO L231 Difference]: Finished difference. Result has 83 places, 78 transitions, 319 flow [2025-01-10 01:07:16,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=319, PETRI_PLACES=83, PETRI_TRANSITIONS=78} [2025-01-10 01:07:16,320 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 6 predicate places. [2025-01-10 01:07:16,321 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 78 transitions, 319 flow [2025-01-10 01:07:16,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 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 01:07:16,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:16,321 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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 01:07:16,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:07:16,321 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:07:16,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:16,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1714825241, now seen corresponding path program 1 times [2025-01-10 01:07:16,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:16,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546955124] [2025-01-10 01:07:16,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:16,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:16,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:07:16,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:07:16,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:16,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:16,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:07:16,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:16,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546955124] [2025-01-10 01:07:16,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546955124] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:16,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:16,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:07:16,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621155666] [2025-01-10 01:07:16,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:16,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:07:16,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:16,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:07:16,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:07:16,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2025-01-10 01:07:16,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 78 transitions, 319 flow. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 0 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 01:07:16,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:16,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2025-01-10 01:07:16,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:18,881 INFO L124 PetriNetUnfolderBase]: 24044/36885 cut-off events. [2025-01-10 01:07:18,882 INFO L125 PetriNetUnfolderBase]: For 19157/21390 co-relation queries the response was YES. [2025-01-10 01:07:19,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84349 conditions, 36885 events. 24044/36885 cut-off events. For 19157/21390 co-relation queries the response was YES. Maximal size of possible extension queue 982. Compared 251569 event pairs, 19339 based on Foata normal form. 1264/29813 useless extension candidates. Maximal degree in co-relation 84307. Up to 32427 conditions per place. [2025-01-10 01:07:19,261 INFO L140 encePairwiseOnDemand]: 84/88 looper letters, 52 selfloop transitions, 4 changer transitions 0/76 dead transitions. [2025-01-10 01:07:19,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 76 transitions, 423 flow [2025-01-10 01:07:19,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:07:19,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:07:19,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2025-01-10 01:07:19,262 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4375 [2025-01-10 01:07:19,262 INFO L175 Difference]: Start difference. First operand has 83 places, 78 transitions, 319 flow. Second operand 4 states and 154 transitions. [2025-01-10 01:07:19,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 76 transitions, 423 flow [2025-01-10 01:07:19,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 76 transitions, 411 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-01-10 01:07:19,271 INFO L231 Difference]: Finished difference. Result has 79 places, 76 transitions, 307 flow [2025-01-10 01:07:19,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=307, PETRI_PLACES=79, PETRI_TRANSITIONS=76} [2025-01-10 01:07:19,272 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 2 predicate places. [2025-01-10 01:07:19,272 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 76 transitions, 307 flow [2025-01-10 01:07:19,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 0 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 01:07:19,273 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:19,273 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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 01:07:19,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:07:19,273 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:07:19,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:19,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1576797598, now seen corresponding path program 1 times [2025-01-10 01:07:19,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:19,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574890472] [2025-01-10 01:07:19,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:19,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:19,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:07:19,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:07:19,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:19,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:19,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:07:19,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:19,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574890472] [2025-01-10 01:07:19,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574890472] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:19,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:19,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:07:19,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920125160] [2025-01-10 01:07:19,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:19,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:07:19,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:19,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:07:19,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:07:19,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 88 [2025-01-10 01:07:19,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 76 transitions, 307 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 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 01:07:19,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:19,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 88 [2025-01-10 01:07:19,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand