./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 82435f17481c054c9c5a8a1deca188b6bf36f1a34e751392b5a27cd7180adc30 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:40:13,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:40:13,935 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:40:13,942 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:40:13,942 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:40:13,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:40:13,975 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:40:13,975 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:40:13,976 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:40:13,976 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:40:13,976 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:40:13,977 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:40:13,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:40:13,977 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:40:13,977 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:40:13,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:40:13,977 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:40:13,978 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:40:13,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:40:13,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:40:13,978 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:40:13,978 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:40:13,978 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:40:13,978 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:40:13,979 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:40:13,979 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:40:13,979 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:40:13,979 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:40:13,979 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:40:13,979 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:40:13,979 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:40:13,979 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:40:13,979 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:40:13,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:40:13,980 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:40:13,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:40:13,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:40:13,980 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:40:13,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:40:13,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:40:13,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:40:13,981 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:40:13,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:40:13,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:40:13,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:40:13,981 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:40:13,981 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:40:13,981 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 -> 82435f17481c054c9c5a8a1deca188b6bf36f1a34e751392b5a27cd7180adc30 [2025-01-10 00:40:14,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:40:14,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:40:14,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:40:14,268 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:40:14,268 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:40:14,269 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur.i [2025-01-10 00:40:15,472 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b34b48815/f880de3506e343a9b3fb9c3610e7c5e2/FLAGa83d62c24 [2025-01-10 00:40:15,795 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:40:15,797 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur.i [2025-01-10 00:40:15,810 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b34b48815/f880de3506e343a9b3fb9c3610e7c5e2/FLAGa83d62c24 [2025-01-10 00:40:15,826 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b34b48815/f880de3506e343a9b3fb9c3610e7c5e2 [2025-01-10 00:40:15,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:40:15,830 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:40:15,831 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:40:15,831 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:40:15,834 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:40:15,835 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:40:15" (1/1) ... [2025-01-10 00:40:15,836 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75822a9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:15, skipping insertion in model container [2025-01-10 00:40:15,836 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:40:15" (1/1) ... [2025-01-10 00:40:15,866 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:40:16,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:40:16,216 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:40:16,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:40:16,295 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:40:16,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:16 WrapperNode [2025-01-10 00:40:16,297 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:40:16,298 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:40:16,299 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:40:16,299 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:40:16,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:16" (1/1) ... [2025-01-10 00:40:16,317 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:16" (1/1) ... [2025-01-10 00:40:16,346 INFO L138 Inliner]: procedures = 165, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 146 [2025-01-10 00:40:16,347 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:40:16,348 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:40:16,348 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:40:16,348 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:40:16,356 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:16" (1/1) ... [2025-01-10 00:40:16,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:16" (1/1) ... [2025-01-10 00:40:16,359 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:16" (1/1) ... [2025-01-10 00:40:16,379 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 5, 1]. The 2 writes are split as follows [0, 0, 2]. [2025-01-10 00:40:16,380 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:16" (1/1) ... [2025-01-10 00:40:16,380 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:16" (1/1) ... [2025-01-10 00:40:16,385 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:16" (1/1) ... [2025-01-10 00:40:16,386 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:16" (1/1) ... [2025-01-10 00:40:16,388 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:16" (1/1) ... [2025-01-10 00:40:16,395 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:16" (1/1) ... [2025-01-10 00:40:16,396 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:16" (1/1) ... [2025-01-10 00:40:16,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:40:16,398 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:40:16,398 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:40:16,398 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:40:16,400 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:16" (1/1) ... [2025-01-10 00:40:16,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:40:16,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:40:16,425 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:40:16,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:40:16,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:40:16,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:40:16,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:40:16,444 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-10 00:40:16,444 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-10 00:40:16,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:40:16,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:40:16,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:40:16,445 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:40:16,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:40:16,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 00:40:16,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:40:16,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:40:16,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:40:16,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:40:16,445 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:40:16,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:40:16,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:40:16,447 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:40:16,580 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:40:16,582 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:40:16,885 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:40:16,886 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:40:17,261 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:40:17,263 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 00:40:17,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:40:17 BoogieIcfgContainer [2025-01-10 00:40:17,265 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:40:17,267 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:40:17,267 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:40:17,270 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:40:17,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:40:15" (1/3) ... [2025-01-10 00:40:17,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1c4b90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:40:17, skipping insertion in model container [2025-01-10 00:40:17,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:16" (2/3) ... [2025-01-10 00:40:17,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1c4b90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:40:17, skipping insertion in model container [2025-01-10 00:40:17,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:40:17" (3/3) ... [2025-01-10 00:40:17,274 INFO L128 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur.i [2025-01-10 00:40:17,288 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:40:17,289 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 37_stack_lock_p0_vs_concur.i that has 2 procedures, 46 locations, 1 initial locations, 2 loop locations, and 16 error locations. [2025-01-10 00:40:17,289 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:40:17,358 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:40:17,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 50 transitions, 104 flow [2025-01-10 00:40:17,445 INFO L124 PetriNetUnfolderBase]: 4/54 cut-off events. [2025-01-10 00:40:17,447 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:40:17,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 54 events. 4/54 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2025-01-10 00:40:17,450 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 50 transitions, 104 flow [2025-01-10 00:40:17,453 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 50 transitions, 104 flow [2025-01-10 00:40:17,465 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:40:17,477 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;@73571683, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:40:17,477 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2025-01-10 00:40:17,482 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:40:17,483 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 00:40:17,483 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:40:17,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:17,483 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:40:17,484 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-01-10 00:40:17,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:17,489 INFO L85 PathProgramCache]: Analyzing trace with hash 429887, now seen corresponding path program 1 times [2025-01-10 00:40:17,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:17,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148100265] [2025-01-10 00:40:17,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:17,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:17,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:40:17,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:40:17,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:17,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:40:18,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:40:18,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:40:18,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148100265] [2025-01-10 00:40:18,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148100265] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:40:18,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:40:18,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:40:18,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128644620] [2025-01-10 00:40:18,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:40:18,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:40:18,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:40:18,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:40:18,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:40:18,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2025-01-10 00:40:18,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 50 transitions, 104 flow. Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:40:18,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:40:18,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2025-01-10 00:40:18,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:40:18,206 INFO L124 PetriNetUnfolderBase]: 37/152 cut-off events. [2025-01-10 00:40:18,207 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:40:18,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 152 events. 37/152 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 492 event pairs, 34 based on Foata normal form. 6/125 useless extension candidates. Maximal degree in co-relation 236. Up to 93 conditions per place. [2025-01-10 00:40:18,212 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 21 selfloop transitions, 0 changer transitions 0/42 dead transitions. [2025-01-10 00:40:18,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 42 transitions, 130 flow [2025-01-10 00:40:18,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:40:18,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:40:18,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2025-01-10 00:40:18,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-01-10 00:40:18,225 INFO L175 Difference]: Start difference. First operand has 49 places, 50 transitions, 104 flow. Second operand 2 states and 70 transitions. [2025-01-10 00:40:18,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 42 transitions, 130 flow [2025-01-10 00:40:18,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 42 transitions, 130 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:40:18,230 INFO L231 Difference]: Finished difference. Result has 45 places, 42 transitions, 88 flow [2025-01-10 00:40:18,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=88, PETRI_PLACES=45, PETRI_TRANSITIONS=42} [2025-01-10 00:40:18,239 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -4 predicate places. [2025-01-10 00:40:18,240 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 88 flow [2025-01-10 00:40:18,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:40:18,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:18,240 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 00:40:18,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:40:18,241 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-01-10 00:40:18,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:18,243 INFO L85 PathProgramCache]: Analyzing trace with hash -74736871, now seen corresponding path program 1 times [2025-01-10 00:40:18,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:18,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425627164] [2025-01-10 00:40:18,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:18,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:18,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:40:18,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:40:18,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:18,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:40:18,651 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:40:18,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:40:18,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:40:18,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:18,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:40:18,694 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:40:18,694 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:40:18,695 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 32 remaining) [2025-01-10 00:40:18,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 32 remaining) [2025-01-10 00:40:18,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 32 remaining) [2025-01-10 00:40:18,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 32 remaining) [2025-01-10 00:40:18,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 32 remaining) [2025-01-10 00:40:18,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 32 remaining) [2025-01-10 00:40:18,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 32 remaining) [2025-01-10 00:40:18,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 32 remaining) [2025-01-10 00:40:18,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 32 remaining) [2025-01-10 00:40:18,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONARRAY_INDEX (22 of 32 remaining) [2025-01-10 00:40:18,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 32 remaining) [2025-01-10 00:40:18,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 32 remaining) [2025-01-10 00:40:18,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONARRAY_INDEX (19 of 32 remaining) [2025-01-10 00:40:18,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONMEMORY_LEAK (18 of 32 remaining) [2025-01-10 00:40:18,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 32 remaining) [2025-01-10 00:40:18,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 32 remaining) [2025-01-10 00:40:18,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (15 of 32 remaining) [2025-01-10 00:40:18,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 32 remaining) [2025-01-10 00:40:18,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 32 remaining) [2025-01-10 00:40:18,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 32 remaining) [2025-01-10 00:40:18,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 32 remaining) [2025-01-10 00:40:18,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 32 remaining) [2025-01-10 00:40:18,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 32 remaining) [2025-01-10 00:40:18,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 32 remaining) [2025-01-10 00:40:18,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 32 remaining) [2025-01-10 00:40:18,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONARRAY_INDEX (6 of 32 remaining) [2025-01-10 00:40:18,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 32 remaining) [2025-01-10 00:40:18,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 32 remaining) [2025-01-10 00:40:18,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONARRAY_INDEX (3 of 32 remaining) [2025-01-10 00:40:18,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONMEMORY_LEAK (2 of 32 remaining) [2025-01-10 00:40:18,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 32 remaining) [2025-01-10 00:40:18,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 32 remaining) [2025-01-10 00:40:18,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:40:18,700 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-10 00:40:18,703 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:40:18,703 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 00:40:18,756 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:40:18,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 93 transitions, 196 flow [2025-01-10 00:40:18,783 INFO L124 PetriNetUnfolderBase]: 8/102 cut-off events. [2025-01-10 00:40:18,783 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:40:18,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 102 events. 8/102 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 391 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 89. Up to 3 conditions per place. [2025-01-10 00:40:18,785 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 93 transitions, 196 flow [2025-01-10 00:40:18,787 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 93 transitions, 196 flow [2025-01-10 00:40:18,789 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:40:18,790 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;@73571683, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:40:18,792 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2025-01-10 00:40:18,793 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:40:18,794 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 00:40:18,794 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:40:18,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:18,794 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:40:18,795 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 00:40:18,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:18,796 INFO L85 PathProgramCache]: Analyzing trace with hash 522236, now seen corresponding path program 1 times [2025-01-10 00:40:18,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:18,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949975627] [2025-01-10 00:40:18,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:18,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:19,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:40:19,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:40:19,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:19,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:40:19,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:40:19,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:40:19,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949975627] [2025-01-10 00:40:19,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949975627] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:40:19,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:40:19,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:40:19,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046312495] [2025-01-10 00:40:19,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:40:19,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:40:19,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:40:19,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:40:19,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:40:19,082 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 93 [2025-01-10 00:40:19,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 93 transitions, 196 flow. Second operand has 2 states, 2 states have (on average 43.0) internal successors, (86), 2 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 00:40:19,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:40:19,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 93 [2025-01-10 00:40:19,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:40:19,665 INFO L124 PetriNetUnfolderBase]: 1675/3949 cut-off events. [2025-01-10 00:40:19,665 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-01-10 00:40:19,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6709 conditions, 3949 events. 1675/3949 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 28856 event pairs, 1564 based on Foata normal form. 219/3345 useless extension candidates. Maximal degree in co-relation 6023. Up to 2701 conditions per place. [2025-01-10 00:40:19,703 INFO L140 encePairwiseOnDemand]: 84/93 looper letters, 39 selfloop transitions, 0 changer transitions 0/80 dead transitions. [2025-01-10 00:40:19,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 80 transitions, 248 flow [2025-01-10 00:40:19,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:40:19,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:40:19,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 132 transitions. [2025-01-10 00:40:19,705 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7096774193548387 [2025-01-10 00:40:19,705 INFO L175 Difference]: Start difference. First operand has 90 places, 93 transitions, 196 flow. Second operand 2 states and 132 transitions. [2025-01-10 00:40:19,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 80 transitions, 248 flow [2025-01-10 00:40:19,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 80 transitions, 248 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:40:19,707 INFO L231 Difference]: Finished difference. Result has 84 places, 80 transitions, 170 flow [2025-01-10 00:40:19,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=170, PETRI_PLACES=84, PETRI_TRANSITIONS=80} [2025-01-10 00:40:19,710 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -6 predicate places. [2025-01-10 00:40:19,710 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 80 transitions, 170 flow [2025-01-10 00:40:19,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 43.0) internal successors, (86), 2 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 00:40:19,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:19,711 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:40:19,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:40:19,711 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 00:40:19,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:19,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1617105385, now seen corresponding path program 1 times [2025-01-10 00:40:19,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:19,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980820089] [2025-01-10 00:40:19,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:19,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:19,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:40:19,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:40:19,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:19,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:40:20,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:40:20,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:40:20,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980820089] [2025-01-10 00:40:20,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980820089] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:40:20,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:40:20,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:40:20,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435754576] [2025-01-10 00:40:20,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:40:20,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:40:20,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:40:20,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:40:20,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:40:20,021 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 93 [2025-01-10 00:40:20,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 80 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:40:20,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:40:20,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 93 [2025-01-10 00:40:20,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:40:20,513 INFO L124 PetriNetUnfolderBase]: 1759/4111 cut-off events. [2025-01-10 00:40:20,513 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-01-10 00:40:20,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7022 conditions, 4111 events. 1759/4111 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 30248 event pairs, 612 based on Foata normal form. 0/3237 useless extension candidates. Maximal degree in co-relation 7017. Up to 2714 conditions per place. [2025-01-10 00:40:20,544 INFO L140 encePairwiseOnDemand]: 86/93 looper letters, 47 selfloop transitions, 3 changer transitions 0/91 dead transitions. [2025-01-10 00:40:20,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 91 transitions, 297 flow [2025-01-10 00:40:20,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:40:20,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:40:20,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2025-01-10 00:40:20,546 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6451612903225806 [2025-01-10 00:40:20,546 INFO L175 Difference]: Start difference. First operand has 84 places, 80 transitions, 170 flow. Second operand 3 states and 180 transitions. [2025-01-10 00:40:20,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 91 transitions, 297 flow [2025-01-10 00:40:20,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 91 transitions, 297 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:40:20,549 INFO L231 Difference]: Finished difference. Result has 87 places, 82 transitions, 195 flow [2025-01-10 00:40:20,549 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=195, PETRI_PLACES=87, PETRI_TRANSITIONS=82} [2025-01-10 00:40:20,550 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -3 predicate places. [2025-01-10 00:40:20,550 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 82 transitions, 195 flow [2025-01-10 00:40:20,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:40:20,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:20,551 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:40:20,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:40:20,551 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 00:40:20,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:20,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1617105383, now seen corresponding path program 1 times [2025-01-10 00:40:20,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:20,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121336213] [2025-01-10 00:40:20,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:20,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:20,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:40:20,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:40:20,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:20,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:40:20,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:40:20,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:40:20,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121336213] [2025-01-10 00:40:20,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121336213] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:40:20,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:40:20,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:40:20,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250168314] [2025-01-10 00:40:20,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:40:20,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:40:20,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:40:20,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:40:20,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:40:20,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 93 [2025-01-10 00:40:20,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 82 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:40:20,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:40:20,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 93 [2025-01-10 00:40:20,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:40:21,634 INFO L124 PetriNetUnfolderBase]: 3529/7485 cut-off events. [2025-01-10 00:40:21,635 INFO L125 PetriNetUnfolderBase]: For 178/178 co-relation queries the response was YES. [2025-01-10 00:40:21,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13896 conditions, 7485 events. 3529/7485 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 55445 event pairs, 1644 based on Foata normal form. 0/6136 useless extension candidates. Maximal degree in co-relation 13889. Up to 3218 conditions per place. [2025-01-10 00:40:21,682 INFO L140 encePairwiseOnDemand]: 79/93 looper letters, 75 selfloop transitions, 8 changer transitions 0/117 dead transitions. [2025-01-10 00:40:21,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 117 transitions, 449 flow [2025-01-10 00:40:21,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:40:21,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:40:21,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2025-01-10 00:40:21,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6845878136200717 [2025-01-10 00:40:21,685 INFO L175 Difference]: Start difference. First operand has 87 places, 82 transitions, 195 flow. Second operand 3 states and 191 transitions. [2025-01-10 00:40:21,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 117 transitions, 449 flow [2025-01-10 00:40:21,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 117 transitions, 445 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:40:21,688 INFO L231 Difference]: Finished difference. Result has 90 places, 89 transitions, 266 flow [2025-01-10 00:40:21,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=266, PETRI_PLACES=90, PETRI_TRANSITIONS=89} [2025-01-10 00:40:21,689 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 0 predicate places. [2025-01-10 00:40:21,689 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 89 transitions, 266 flow [2025-01-10 00:40:21,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:40:21,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:21,689 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:40:21,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:40:21,690 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 00:40:21,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:21,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1617105382, now seen corresponding path program 1 times [2025-01-10 00:40:21,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:21,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500978072] [2025-01-10 00:40:21,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:21,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:21,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:40:21,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:40:21,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:21,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:40:21,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:40:21,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:40:21,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500978072] [2025-01-10 00:40:21,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500978072] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:40:21,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:40:21,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:40:21,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539057455] [2025-01-10 00:40:21,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:40:21,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:40:21,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:40:21,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:40:21,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:40:22,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 93 [2025-01-10 00:40:22,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 89 transitions, 266 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:40:22,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:40:22,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 93 [2025-01-10 00:40:22,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:40:22,522 INFO L124 PetriNetUnfolderBase]: 2543/5677 cut-off events. [2025-01-10 00:40:22,523 INFO L125 PetriNetUnfolderBase]: For 1528/1573 co-relation queries the response was YES. [2025-01-10 00:40:22,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11334 conditions, 5677 events. 2543/5677 cut-off events. For 1528/1573 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 41344 event pairs, 1015 based on Foata normal form. 663/5609 useless extension candidates. Maximal degree in co-relation 11326. Up to 3310 conditions per place. [2025-01-10 00:40:22,561 INFO L140 encePairwiseOnDemand]: 85/93 looper letters, 61 selfloop transitions, 3 changer transitions 0/104 dead transitions. [2025-01-10 00:40:22,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 104 transitions, 437 flow [2025-01-10 00:40:22,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:40:22,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:40:22,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2025-01-10 00:40:22,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6344086021505376 [2025-01-10 00:40:22,563 INFO L175 Difference]: Start difference. First operand has 90 places, 89 transitions, 266 flow. Second operand 3 states and 177 transitions. [2025-01-10 00:40:22,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 104 transitions, 437 flow [2025-01-10 00:40:22,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 104 transitions, 421 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:40:22,572 INFO L231 Difference]: Finished difference. Result has 84 places, 83 transitions, 242 flow [2025-01-10 00:40:22,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=82, 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=3, PETRI_FLOW=242, PETRI_PLACES=84, PETRI_TRANSITIONS=83} [2025-01-10 00:40:22,573 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -6 predicate places. [2025-01-10 00:40:22,573 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 83 transitions, 242 flow [2025-01-10 00:40:22,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:40:22,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:22,573 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-01-10 00:40:22,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:40:22,574 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-01-10 00:40:22,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:22,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1103153622, now seen corresponding path program 1 times [2025-01-10 00:40:22,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:22,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319242316] [2025-01-10 00:40:22,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:22,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:22,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:40:22,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:40:22,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:22,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:40:22,895 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:40:22,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:40:22,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:40:22,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:22,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:40:22,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:40:22,924 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:40:22,924 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 47 remaining) [2025-01-10 00:40:22,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 47 remaining) [2025-01-10 00:40:22,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 47 remaining) [2025-01-10 00:40:22,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 47 remaining) [2025-01-10 00:40:22,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 47 remaining) [2025-01-10 00:40:22,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 47 remaining) [2025-01-10 00:40:22,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 47 remaining) [2025-01-10 00:40:22,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 47 remaining) [2025-01-10 00:40:22,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 47 remaining) [2025-01-10 00:40:22,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONARRAY_INDEX (37 of 47 remaining) [2025-01-10 00:40:22,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 47 remaining) [2025-01-10 00:40:22,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 47 remaining) [2025-01-10 00:40:22,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONARRAY_INDEX (34 of 47 remaining) [2025-01-10 00:40:22,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONMEMORY_LEAK (33 of 47 remaining) [2025-01-10 00:40:22,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 47 remaining) [2025-01-10 00:40:22,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 47 remaining) [2025-01-10 00:40:22,926 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (30 of 47 remaining) [2025-01-10 00:40:22,926 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 47 remaining) [2025-01-10 00:40:22,926 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 47 remaining) [2025-01-10 00:40:22,926 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 47 remaining) [2025-01-10 00:40:22,926 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 47 remaining) [2025-01-10 00:40:22,926 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 47 remaining) [2025-01-10 00:40:22,926 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 47 remaining) [2025-01-10 00:40:22,926 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 47 remaining) [2025-01-10 00:40:22,926 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 47 remaining) [2025-01-10 00:40:22,926 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONARRAY_INDEX (21 of 47 remaining) [2025-01-10 00:40:22,926 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 47 remaining) [2025-01-10 00:40:22,926 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 47 remaining) [2025-01-10 00:40:22,926 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONARRAY_INDEX (18 of 47 remaining) [2025-01-10 00:40:22,926 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONMEMORY_LEAK (17 of 47 remaining) [2025-01-10 00:40:22,926 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 47 remaining) [2025-01-10 00:40:22,927 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 47 remaining) [2025-01-10 00:40:22,927 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 47 remaining) [2025-01-10 00:40:22,927 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 47 remaining) [2025-01-10 00:40:22,927 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 47 remaining) [2025-01-10 00:40:22,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 47 remaining) [2025-01-10 00:40:22,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 47 remaining) [2025-01-10 00:40:22,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 47 remaining) [2025-01-10 00:40:22,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 47 remaining) [2025-01-10 00:40:22,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 47 remaining) [2025-01-10 00:40:22,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONARRAY_INDEX (6 of 47 remaining) [2025-01-10 00:40:22,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 47 remaining) [2025-01-10 00:40:22,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 47 remaining) [2025-01-10 00:40:22,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONARRAY_INDEX (3 of 47 remaining) [2025-01-10 00:40:22,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONMEMORY_LEAK (2 of 47 remaining) [2025-01-10 00:40:22,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 47 remaining) [2025-01-10 00:40:22,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 47 remaining) [2025-01-10 00:40:22,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:40:22,928 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-10 00:40:22,929 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:40:22,929 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 00:40:22,979 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:40:22,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 136 transitions, 290 flow [2025-01-10 00:40:22,998 INFO L124 PetriNetUnfolderBase]: 12/150 cut-off events. [2025-01-10 00:40:22,998 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 00:40:22,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 150 events. 12/150 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 681 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 131. Up to 4 conditions per place. [2025-01-10 00:40:22,999 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 136 transitions, 290 flow [2025-01-10 00:40:23,001 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 136 transitions, 290 flow [2025-01-10 00:40:23,002 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:40:23,003 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;@73571683, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:40:23,003 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2025-01-10 00:40:23,004 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:40:23,004 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 00:40:23,004 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:40:23,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:23,005 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:40:23,005 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-10 00:40:23,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:23,005 INFO L85 PathProgramCache]: Analyzing trace with hash 657284, now seen corresponding path program 1 times [2025-01-10 00:40:23,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:23,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412625863] [2025-01-10 00:40:23,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:23,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:23,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:40:23,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:40:23,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:23,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:40:23,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:40:23,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:40:23,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412625863] [2025-01-10 00:40:23,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412625863] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:40:23,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:40:23,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:40:23,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021983689] [2025-01-10 00:40:23,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:40:23,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:40:23,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:40:23,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:40:23,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:40:23,265 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 136 [2025-01-10 00:40:23,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 136 transitions, 290 flow. Second operand has 2 states, 2 states have (on average 63.0) internal successors, (126), 2 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 00:40:23,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:40:23,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 136 [2025-01-10 00:40:23,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:40:28,940 INFO L124 PetriNetUnfolderBase]: 48655/90651 cut-off events. [2025-01-10 00:40:28,941 INFO L125 PetriNetUnfolderBase]: For 2090/2090 co-relation queries the response was YES. [2025-01-10 00:40:29,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159166 conditions, 90651 events. 48655/90651 cut-off events. For 2090/2090 co-relation queries the response was YES. Maximal size of possible extension queue 2067. Compared 897403 event pairs, 45628 based on Foata normal form. 5916/78705 useless extension candidates. Maximal degree in co-relation 79316. Up to 67159 conditions per place. [2025-01-10 00:40:29,566 INFO L140 encePairwiseOnDemand]: 123/136 looper letters, 57 selfloop transitions, 0 changer transitions 0/118 dead transitions. [2025-01-10 00:40:29,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 118 transitions, 368 flow [2025-01-10 00:40:29,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:40:29,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:40:29,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 194 transitions. [2025-01-10 00:40:29,568 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7132352941176471 [2025-01-10 00:40:29,568 INFO L175 Difference]: Start difference. First operand has 131 places, 136 transitions, 290 flow. Second operand 2 states and 194 transitions. [2025-01-10 00:40:29,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 118 transitions, 368 flow [2025-01-10 00:40:29,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 118 transitions, 366 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-10 00:40:29,577 INFO L231 Difference]: Finished difference. Result has 123 places, 118 transitions, 252 flow [2025-01-10 00:40:29,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=252, PETRI_PLACES=123, PETRI_TRANSITIONS=118} [2025-01-10 00:40:29,580 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, -8 predicate places. [2025-01-10 00:40:29,580 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 118 transitions, 252 flow [2025-01-10 00:40:29,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 63.0) internal successors, (126), 2 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 00:40:29,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:29,580 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:40:29,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:40:29,581 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-10 00:40:29,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:29,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1887471443, now seen corresponding path program 1 times [2025-01-10 00:40:29,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:29,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436423696] [2025-01-10 00:40:29,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:29,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:29,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:40:29,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:40:29,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:29,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:40:29,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:40:29,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:40:29,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436423696] [2025-01-10 00:40:29,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436423696] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:40:29,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:40:29,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:40:29,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906745416] [2025-01-10 00:40:29,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:40:29,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:40:29,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:40:29,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:40:29,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:40:29,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 136 [2025-01-10 00:40:29,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 118 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:40:29,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:40:29,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 136 [2025-01-10 00:40:29,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:40:35,818 INFO L124 PetriNetUnfolderBase]: 49258/91539 cut-off events. [2025-01-10 00:40:35,818 INFO L125 PetriNetUnfolderBase]: For 1116/1116 co-relation queries the response was YES. [2025-01-10 00:40:35,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160652 conditions, 91539 events. 49258/91539 cut-off events. For 1116/1116 co-relation queries the response was YES. Maximal size of possible extension queue 2241. Compared 907695 event pairs, 23454 based on Foata normal form. 0/73416 useless extension candidates. Maximal degree in co-relation 160646. Up to 67322 conditions per place. [2025-01-10 00:40:36,302 INFO L140 encePairwiseOnDemand]: 126/136 looper letters, 69 selfloop transitions, 4 changer transitions 0/134 dead transitions. [2025-01-10 00:40:36,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 134 transitions, 440 flow [2025-01-10 00:40:36,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:40:36,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:40:36,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2025-01-10 00:40:36,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6495098039215687 [2025-01-10 00:40:36,304 INFO L175 Difference]: Start difference. First operand has 123 places, 118 transitions, 252 flow. Second operand 3 states and 265 transitions. [2025-01-10 00:40:36,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 134 transitions, 440 flow [2025-01-10 00:40:36,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 134 transitions, 440 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:40:36,309 INFO L231 Difference]: Finished difference. Result has 126 places, 121 transitions, 288 flow [2025-01-10 00:40:36,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=288, PETRI_PLACES=126, PETRI_TRANSITIONS=121} [2025-01-10 00:40:36,310 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, -5 predicate places. [2025-01-10 00:40:36,310 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 121 transitions, 288 flow [2025-01-10 00:40:36,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:40:36,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:36,310 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:40:36,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:40:36,310 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-10 00:40:36,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:36,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1887471441, now seen corresponding path program 1 times [2025-01-10 00:40:36,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:36,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287871288] [2025-01-10 00:40:36,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:36,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:36,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:40:36,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:40:36,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:36,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:40:36,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:40:36,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:40:36,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287871288] [2025-01-10 00:40:36,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287871288] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:40:36,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:40:36,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:40:36,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909888249] [2025-01-10 00:40:36,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:40:36,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:40:36,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:40:36,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:40:36,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:40:36,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 136 [2025-01-10 00:40:36,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 121 transitions, 288 flow. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:40:36,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:40:36,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 136 [2025-01-10 00:40:36,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:40:47,231 INFO L124 PetriNetUnfolderBase]: 105512/182402 cut-off events. [2025-01-10 00:40:47,232 INFO L125 PetriNetUnfolderBase]: For 6244/6244 co-relation queries the response was YES. [2025-01-10 00:40:47,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348576 conditions, 182402 events. 105512/182402 cut-off events. For 6244/6244 co-relation queries the response was YES. Maximal size of possible extension queue 3753. Compared 1811447 event pairs, 52476 based on Foata normal form. 0/149784 useless extension candidates. Maximal degree in co-relation 348568. Up to 88326 conditions per place. [2025-01-10 00:40:48,486 INFO L140 encePairwiseOnDemand]: 121/136 looper letters, 112 selfloop transitions, 9 changer transitions 0/175 dead transitions. [2025-01-10 00:40:48,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 175 transitions, 670 flow [2025-01-10 00:40:48,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:40:48,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:40:48,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2025-01-10 00:40:48,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7034313725490197 [2025-01-10 00:40:48,488 INFO L175 Difference]: Start difference. First operand has 126 places, 121 transitions, 288 flow. Second operand 3 states and 287 transitions. [2025-01-10 00:40:48,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 175 transitions, 670 flow [2025-01-10 00:40:48,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 175 transitions, 664 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:40:48,494 INFO L231 Difference]: Finished difference. Result has 129 places, 129 transitions, 366 flow [2025-01-10 00:40:48,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=366, PETRI_PLACES=129, PETRI_TRANSITIONS=129} [2025-01-10 00:40:48,494 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, -2 predicate places. [2025-01-10 00:40:48,494 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 129 transitions, 366 flow [2025-01-10 00:40:48,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:40:48,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:48,495 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:40:48,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:40:48,495 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-10 00:40:48,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:48,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1887471440, now seen corresponding path program 1 times [2025-01-10 00:40:48,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:48,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071871628] [2025-01-10 00:40:48,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:48,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:48,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:40:48,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:40:48,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:48,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:40:48,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:40:48,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:40:48,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071871628] [2025-01-10 00:40:48,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071871628] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:40:48,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:40:48,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:40:48,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147374366] [2025-01-10 00:40:48,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:40:48,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:40:48,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:40:48,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:40:48,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:40:48,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 136 [2025-01-10 00:40:48,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 129 transitions, 366 flow. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:40:48,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:40:48,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 136 [2025-01-10 00:40:48,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand