./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-lit/sssc12_variant.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d 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-lit/sssc12_variant.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 0ff08c0361e0fdb1af5d85b333c023f31932563eeba591605f3b3b9ddd16afc8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:27:29,972 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:27:30,006 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:27:30,009 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:27:30,009 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:27:30,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:27:30,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:27:30,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:27:30,024 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:27:30,024 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:27:30,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:27:30,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:27:30,024 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:27:30,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:27:30,024 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:27:30,024 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:27:30,024 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:27:30,024 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:27:30,024 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:27:30,024 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:27:30,024 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:27:30,025 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:27:30,025 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:27:30,025 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:27:30,025 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:27:30,025 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:27:30,025 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:27:30,025 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:27:30,025 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:27:30,025 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:27:30,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:27:30,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:27:30,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:27:30,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:27:30,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:27:30,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:27:30,025 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:27:30,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:27:30,025 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:27:30,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:27:30,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:27:30,026 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:27:30,026 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 -> 0ff08c0361e0fdb1af5d85b333c023f31932563eeba591605f3b3b9ddd16afc8 [2025-02-08 08:27:30,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:27:30,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:27:30,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:27:30,199 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:27:30,199 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:27:30,200 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/sssc12_variant.i [2025-02-08 08:27:31,422 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/63b392eb6/40bc452b519f470394663271e5dd18b9/FLAG87183a12a [2025-02-08 08:27:31,781 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:27:31,783 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-lit/sssc12_variant.i [2025-02-08 08:27:31,799 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/63b392eb6/40bc452b519f470394663271e5dd18b9/FLAG87183a12a [2025-02-08 08:27:31,992 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/63b392eb6/40bc452b519f470394663271e5dd18b9 [2025-02-08 08:27:31,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:27:31,997 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:27:31,998 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:27:31,998 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:27:32,001 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:27:32,002 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:27:31" (1/1) ... [2025-02-08 08:27:32,003 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e8e7021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:32, skipping insertion in model container [2025-02-08 08:27:32,003 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:27:31" (1/1) ... [2025-02-08 08:27:32,032 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:27:32,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:27:32,341 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:27:32,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:27:32,404 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:27:32,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:32 WrapperNode [2025-02-08 08:27:32,404 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:27:32,405 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:27:32,405 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:27:32,405 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:27:32,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:32" (1/1) ... [2025-02-08 08:27:32,423 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:32" (1/1) ... [2025-02-08 08:27:32,441 INFO L138 Inliner]: procedures = 272, calls = 22, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 73 [2025-02-08 08:27:32,441 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:27:32,441 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:27:32,441 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:27:32,441 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:27:32,447 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:32" (1/1) ... [2025-02-08 08:27:32,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:32" (1/1) ... [2025-02-08 08:27:32,449 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:32" (1/1) ... [2025-02-08 08:27:32,456 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [2, 5, 3]. 50 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 2 writes are split as follows [0, 0, 2]. [2025-02-08 08:27:32,456 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:32" (1/1) ... [2025-02-08 08:27:32,457 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:32" (1/1) ... [2025-02-08 08:27:32,460 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:32" (1/1) ... [2025-02-08 08:27:32,461 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:32" (1/1) ... [2025-02-08 08:27:32,464 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:32" (1/1) ... [2025-02-08 08:27:32,465 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:32" (1/1) ... [2025-02-08 08:27:32,466 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:27:32,467 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:27:32,467 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:27:32,467 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:27:32,467 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:32" (1/1) ... [2025-02-08 08:27:32,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:27:32,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:27:32,492 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-02-08 08:27:32,495 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-02-08 08:27:32,508 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2025-02-08 08:27:32,508 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2025-02-08 08:27:32,509 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 08:27:32,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:27:32,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:27:32,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 08:27:32,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:27:32,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:27:32,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 08:27:32,509 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 08:27:32,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 08:27:32,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:27:32,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:27:32,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:27:32,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 08:27:32,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:27:32,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:27:32,510 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:27:32,595 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:27:32,597 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:27:32,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1049: assume { :end_inline___VERIFIER_assert } true;havoc #t~mem6#1; [2025-02-08 08:27:32,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1049-1: havoc __VERIFIER_assert_#in~cond#1; [2025-02-08 08:27:32,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1049-2: havoc __VERIFIER_assert_~cond#1; [2025-02-08 08:27:32,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1050: ~c~0#1 := 1 + ~c~0#1; [2025-02-08 08:27:32,743 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:27:32,743 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:27:32,836 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:27:32,839 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:27:32,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:27:32 BoogieIcfgContainer [2025-02-08 08:27:32,840 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:27:32,841 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:27:32,841 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:27:32,848 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:27:32,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:27:31" (1/3) ... [2025-02-08 08:27:32,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dfde56f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:27:32, skipping insertion in model container [2025-02-08 08:27:32,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:32" (2/3) ... [2025-02-08 08:27:32,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dfde56f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:27:32, skipping insertion in model container [2025-02-08 08:27:32,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:27:32" (3/3) ... [2025-02-08 08:27:32,850 INFO L128 eAbstractionObserver]: Analyzing ICFG sssc12_variant.i [2025-02-08 08:27:32,867 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:27:32,871 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sssc12_variant.i that has 2 procedures, 29 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-02-08 08:27:32,871 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:27:32,910 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:27:32,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 31 transitions, 66 flow [2025-02-08 08:27:32,952 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2025-02-08 08:27:32,953 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:27:32,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 35 events. 2/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2025-02-08 08:27:32,956 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 31 transitions, 66 flow [2025-02-08 08:27:32,958 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 31 transitions, 66 flow [2025-02-08 08:27:32,983 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:27:32,996 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;@6c46598a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:27:32,997 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-08 08:27:33,001 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:27:33,001 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-08 08:27:33,001 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:27:33,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:33,002 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:27:33,002 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 08:27:33,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:33,005 INFO L85 PathProgramCache]: Analyzing trace with hash 213196, now seen corresponding path program 1 times [2025-02-08 08:27:33,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:33,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630845000] [2025-02-08 08:27:33,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:33,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:33,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:27:33,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:27:33,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:33,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:33,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:33,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:33,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630845000] [2025-02-08 08:27:33,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630845000] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:33,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:33,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:27:33,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863992907] [2025-02-08 08:27:33,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:33,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:27:33,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:33,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:27:33,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:27:33,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 31 [2025-02-08 08:27:33,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 31 transitions, 66 flow. Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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-02-08 08:27:33,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:33,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 31 [2025-02-08 08:27:33,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:33,217 INFO L124 PetriNetUnfolderBase]: 14/80 cut-off events. [2025-02-08 08:27:33,220 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:27:33,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 80 events. 14/80 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 254 event pairs, 14 based on Foata normal form. 6/71 useless extension candidates. Maximal degree in co-relation 113. Up to 41 conditions per place. [2025-02-08 08:27:33,222 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 11 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2025-02-08 08:27:33,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 25 transitions, 76 flow [2025-02-08 08:27:33,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:27:33,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:27:33,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 44 transitions. [2025-02-08 08:27:33,231 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7096774193548387 [2025-02-08 08:27:33,232 INFO L175 Difference]: Start difference. First operand has 32 places, 31 transitions, 66 flow. Second operand 2 states and 44 transitions. [2025-02-08 08:27:33,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 25 transitions, 76 flow [2025-02-08 08:27:33,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 25 transitions, 76 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:27:33,237 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 54 flow [2025-02-08 08:27:33,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2025-02-08 08:27:33,242 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, -3 predicate places. [2025-02-08 08:27:33,242 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 54 flow [2025-02-08 08:27:33,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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-02-08 08:27:33,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:33,243 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 08:27:33,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:27:33,243 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 08:27:33,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:33,243 INFO L85 PathProgramCache]: Analyzing trace with hash 2056393028, now seen corresponding path program 1 times [2025-02-08 08:27:33,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:33,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239352538] [2025-02-08 08:27:33,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:33,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:33,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:27:33,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:27:33,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:33,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:27:33,276 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:27:33,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:27:33,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:27:33,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:33,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:27:33,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:27:33,314 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:27:33,315 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-02-08 08:27:33,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2025-02-08 08:27:33,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2025-02-08 08:27:33,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2025-02-08 08:27:33,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2025-02-08 08:27:33,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2025-02-08 08:27:33,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2025-02-08 08:27:33,321 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2025-02-08 08:27:33,321 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 16 remaining) [2025-02-08 08:27:33,321 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2025-02-08 08:27:33,321 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2025-02-08 08:27:33,321 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2025-02-08 08:27:33,321 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 16 remaining) [2025-02-08 08:27:33,321 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 16 remaining) [2025-02-08 08:27:33,321 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2025-02-08 08:27:33,321 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2025-02-08 08:27:33,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:27:33,321 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 08:27:33,323 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:27:33,323 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 08:27:33,354 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:27:33,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 55 transitions, 120 flow [2025-02-08 08:27:33,372 INFO L124 PetriNetUnfolderBase]: 4/64 cut-off events. [2025-02-08 08:27:33,373 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 08:27:33,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 64 events. 4/64 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 170 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 51. Up to 3 conditions per place. [2025-02-08 08:27:33,375 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 55 transitions, 120 flow [2025-02-08 08:27:33,375 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 55 transitions, 120 flow [2025-02-08 08:27:33,377 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:27:33,378 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;@6c46598a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:27:33,379 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-02-08 08:27:33,380 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:27:33,381 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-08 08:27:33,381 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:27:33,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:33,381 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:27:33,382 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-02-08 08:27:33,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:33,382 INFO L85 PathProgramCache]: Analyzing trace with hash 267811, now seen corresponding path program 1 times [2025-02-08 08:27:33,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:33,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882993583] [2025-02-08 08:27:33,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:33,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:33,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:27:33,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:27:33,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:33,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:33,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:33,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:33,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882993583] [2025-02-08 08:27:33,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882993583] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:33,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:33,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:27:33,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364315777] [2025-02-08 08:27:33,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:33,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:27:33,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:33,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:27:33,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:27:33,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2025-02-08 08:27:33,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 120 flow. Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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-02-08 08:27:33,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:33,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2025-02-08 08:27:33,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:33,566 INFO L124 PetriNetUnfolderBase]: 294/941 cut-off events. [2025-02-08 08:27:33,569 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-02-08 08:27:33,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1483 conditions, 941 events. 294/941 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6529 event pairs, 294 based on Foata normal form. 102/878 useless extension candidates. Maximal degree in co-relation 993. Up to 513 conditions per place. [2025-02-08 08:27:33,577 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 19 selfloop transitions, 0 changer transitions 0/46 dead transitions. [2025-02-08 08:27:33,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 46 transitions, 140 flow [2025-02-08 08:27:33,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:27:33,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:27:33,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 80 transitions. [2025-02-08 08:27:33,581 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2025-02-08 08:27:33,581 INFO L175 Difference]: Start difference. First operand has 56 places, 55 transitions, 120 flow. Second operand 2 states and 80 transitions. [2025-02-08 08:27:33,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 46 transitions, 140 flow [2025-02-08 08:27:33,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 46 transitions, 140 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:27:33,583 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 102 flow [2025-02-08 08:27:33,584 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=102, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2025-02-08 08:27:33,585 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -4 predicate places. [2025-02-08 08:27:33,585 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 102 flow [2025-02-08 08:27:33,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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-02-08 08:27:33,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:33,585 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-02-08 08:27:33,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:27:33,586 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-02-08 08:27:33,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:33,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1464559763, now seen corresponding path program 1 times [2025-02-08 08:27:33,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:33,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67628243] [2025-02-08 08:27:33,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:33,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:33,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:27:33,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:27:33,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:33,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:27:33,628 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:27:33,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:27:33,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:27:33,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:33,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:27:33,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:27:33,637 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:27:33,638 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-02-08 08:27:33,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (21 of 23 remaining) [2025-02-08 08:27:33,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 23 remaining) [2025-02-08 08:27:33,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 23 remaining) [2025-02-08 08:27:33,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 23 remaining) [2025-02-08 08:27:33,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 23 remaining) [2025-02-08 08:27:33,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 23 remaining) [2025-02-08 08:27:33,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 23 remaining) [2025-02-08 08:27:33,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONMEMORY_LEAK (14 of 23 remaining) [2025-02-08 08:27:33,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 23 remaining) [2025-02-08 08:27:33,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 23 remaining) [2025-02-08 08:27:33,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 23 remaining) [2025-02-08 08:27:33,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 23 remaining) [2025-02-08 08:27:33,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 23 remaining) [2025-02-08 08:27:33,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 23 remaining) [2025-02-08 08:27:33,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 23 remaining) [2025-02-08 08:27:33,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 23 remaining) [2025-02-08 08:27:33,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 23 remaining) [2025-02-08 08:27:33,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 23 remaining) [2025-02-08 08:27:33,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 23 remaining) [2025-02-08 08:27:33,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 23 remaining) [2025-02-08 08:27:33,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 23 remaining) [2025-02-08 08:27:33,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 23 remaining) [2025-02-08 08:27:33,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:27:33,640 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 08:27:33,640 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:27:33,640 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 08:27:33,663 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:27:33,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 79 transitions, 176 flow [2025-02-08 08:27:33,672 INFO L124 PetriNetUnfolderBase]: 6/93 cut-off events. [2025-02-08 08:27:33,672 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 08:27:33,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 93 events. 6/93 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 317 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 74. Up to 4 conditions per place. [2025-02-08 08:27:33,672 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 79 transitions, 176 flow [2025-02-08 08:27:33,673 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 79 transitions, 176 flow [2025-02-08 08:27:33,674 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:27:33,674 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;@6c46598a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:27:33,674 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-02-08 08:27:33,675 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:27:33,675 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-08 08:27:33,675 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:27:33,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:33,675 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:27:33,675 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-02-08 08:27:33,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:33,676 INFO L85 PathProgramCache]: Analyzing trace with hash 346258, now seen corresponding path program 1 times [2025-02-08 08:27:33,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:33,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091583199] [2025-02-08 08:27:33,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:33,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:33,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:27:33,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:27:33,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:33,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:33,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:33,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:33,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091583199] [2025-02-08 08:27:33,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091583199] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:33,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:33,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:27:33,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923717419] [2025-02-08 08:27:33,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:33,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:27:33,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:33,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:27:33,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:27:33,691 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 79 [2025-02-08 08:27:33,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 79 transitions, 176 flow. Second operand has 2 states, 2 states have (on average 42.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:27:33,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:33,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 79 [2025-02-08 08:27:33,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:34,486 INFO L124 PetriNetUnfolderBase]: 3878/9172 cut-off events. [2025-02-08 08:27:34,486 INFO L125 PetriNetUnfolderBase]: For 458/458 co-relation queries the response was YES. [2025-02-08 08:27:34,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15091 conditions, 9172 events. 3878/9172 cut-off events. For 458/458 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 86959 event pairs, 3878 based on Foata normal form. 1254/9125 useless extension candidates. Maximal degree in co-relation 2254. Up to 5633 conditions per place. [2025-02-08 08:27:34,548 INFO L140 encePairwiseOnDemand]: 72/79 looper letters, 27 selfloop transitions, 0 changer transitions 0/67 dead transitions. [2025-02-08 08:27:34,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 67 transitions, 206 flow [2025-02-08 08:27:34,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:27:34,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:27:34,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 116 transitions. [2025-02-08 08:27:34,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7341772151898734 [2025-02-08 08:27:34,550 INFO L175 Difference]: Start difference. First operand has 80 places, 79 transitions, 176 flow. Second operand 2 states and 116 transitions. [2025-02-08 08:27:34,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 67 transitions, 206 flow [2025-02-08 08:27:34,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 67 transitions, 204 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 08:27:34,552 INFO L231 Difference]: Finished difference. Result has 75 places, 67 transitions, 150 flow [2025-02-08 08:27:34,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=150, PETRI_PLACES=75, PETRI_TRANSITIONS=67} [2025-02-08 08:27:34,553 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -5 predicate places. [2025-02-08 08:27:34,553 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 67 transitions, 150 flow [2025-02-08 08:27:34,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 42.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:27:34,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:34,554 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:34,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:27:34,554 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-02-08 08:27:34,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:34,554 INFO L85 PathProgramCache]: Analyzing trace with hash -979467147, now seen corresponding path program 1 times [2025-02-08 08:27:34,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:34,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000219089] [2025-02-08 08:27:34,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:34,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:34,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:27:34,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:27:34,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:34,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:34,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:34,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:34,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000219089] [2025-02-08 08:27:34,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000219089] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:34,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:34,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:27:34,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006188574] [2025-02-08 08:27:34,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:34,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:27:34,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:34,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:27:34,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:27:34,685 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 79 [2025-02-08 08:27:34,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 67 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:27:34,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:34,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 79 [2025-02-08 08:27:34,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:35,683 INFO L124 PetriNetUnfolderBase]: 7668/14762 cut-off events. [2025-02-08 08:27:35,684 INFO L125 PetriNetUnfolderBase]: For 383/383 co-relation queries the response was YES. [2025-02-08 08:27:35,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26100 conditions, 14762 events. 7668/14762 cut-off events. For 383/383 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 124535 event pairs, 7668 based on Foata normal form. 0/14601 useless extension candidates. Maximal degree in co-relation 26094. Up to 11000 conditions per place. [2025-02-08 08:27:35,746 INFO L140 encePairwiseOnDemand]: 69/79 looper letters, 32 selfloop transitions, 1 changer transitions 0/58 dead transitions. [2025-02-08 08:27:35,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 58 transitions, 198 flow [2025-02-08 08:27:35,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:27:35,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:27:35,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2025-02-08 08:27:35,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5063291139240507 [2025-02-08 08:27:35,749 INFO L175 Difference]: Start difference. First operand has 75 places, 67 transitions, 150 flow. Second operand 3 states and 120 transitions. [2025-02-08 08:27:35,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 58 transitions, 198 flow [2025-02-08 08:27:35,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 58 transitions, 198 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:27:35,752 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 134 flow [2025-02-08 08:27:35,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2025-02-08 08:27:35,753 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -12 predicate places. [2025-02-08 08:27:35,754 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 134 flow [2025-02-08 08:27:35,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:27:35,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:35,754 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:35,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:27:35,755 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-02-08 08:27:35,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:35,755 INFO L85 PathProgramCache]: Analyzing trace with hash -979467146, now seen corresponding path program 1 times [2025-02-08 08:27:35,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:35,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638224562] [2025-02-08 08:27:35,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:35,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:35,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:27:35,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:27:35,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:35,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:36,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:36,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:36,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638224562] [2025-02-08 08:27:36,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638224562] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:36,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:36,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:27:36,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382706146] [2025-02-08 08:27:36,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:36,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:27:36,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:36,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:27:36,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:27:36,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 79 [2025-02-08 08:27:36,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 134 flow. Second operand has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 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-02-08 08:27:36,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:36,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 79 [2025-02-08 08:27:36,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:37,407 INFO L124 PetriNetUnfolderBase]: 8819/18637 cut-off events. [2025-02-08 08:27:37,408 INFO L125 PetriNetUnfolderBase]: For 413/413 co-relation queries the response was YES. [2025-02-08 08:27:37,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31827 conditions, 18637 events. 8819/18637 cut-off events. For 413/413 co-relation queries the response was YES. Maximal size of possible extension queue 973. Compared 183153 event pairs, 2917 based on Foata normal form. 438/17578 useless extension candidates. Maximal degree in co-relation 31820. Up to 7210 conditions per place. [2025-02-08 08:27:37,500 INFO L140 encePairwiseOnDemand]: 70/79 looper letters, 87 selfloop transitions, 9 changer transitions 0/123 dead transitions. [2025-02-08 08:27:37,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 123 transitions, 491 flow [2025-02-08 08:27:37,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:27:37,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:27:37,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 321 transitions. [2025-02-08 08:27:37,503 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6772151898734177 [2025-02-08 08:27:37,503 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 134 flow. Second operand 6 states and 321 transitions. [2025-02-08 08:27:37,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 123 transitions, 491 flow [2025-02-08 08:27:37,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 123 transitions, 490 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:27:37,509 INFO L231 Difference]: Finished difference. Result has 76 places, 66 transitions, 201 flow [2025-02-08 08:27:37,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=201, PETRI_PLACES=76, PETRI_TRANSITIONS=66} [2025-02-08 08:27:37,510 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -4 predicate places. [2025-02-08 08:27:37,511 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 66 transitions, 201 flow [2025-02-08 08:27:37,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 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-02-08 08:27:37,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:37,512 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-02-08 08:27:37,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:27:37,514 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-02-08 08:27:37,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:37,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1497752317, now seen corresponding path program 1 times [2025-02-08 08:27:37,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:37,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396328871] [2025-02-08 08:27:37,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:37,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:37,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:27:37,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:27:37,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:37,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:27:37,530 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:27:37,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:27:37,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:27:37,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:37,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:27:37,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:27:37,543 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:27:37,544 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 30 remaining) [2025-02-08 08:27:37,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (28 of 30 remaining) [2025-02-08 08:27:37,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 30 remaining) [2025-02-08 08:27:37,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 30 remaining) [2025-02-08 08:27:37,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 30 remaining) [2025-02-08 08:27:37,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 30 remaining) [2025-02-08 08:27:37,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 30 remaining) [2025-02-08 08:27:37,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 30 remaining) [2025-02-08 08:27:37,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONMEMORY_LEAK (21 of 30 remaining) [2025-02-08 08:27:37,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 30 remaining) [2025-02-08 08:27:37,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 30 remaining) [2025-02-08 08:27:37,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 30 remaining) [2025-02-08 08:27:37,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 30 remaining) [2025-02-08 08:27:37,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 30 remaining) [2025-02-08 08:27:37,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 30 remaining) [2025-02-08 08:27:37,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONMEMORY_LEAK (14 of 30 remaining) [2025-02-08 08:27:37,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 30 remaining) [2025-02-08 08:27:37,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 30 remaining) [2025-02-08 08:27:37,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 30 remaining) [2025-02-08 08:27:37,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 30 remaining) [2025-02-08 08:27:37,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 30 remaining) [2025-02-08 08:27:37,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 30 remaining) [2025-02-08 08:27:37,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 30 remaining) [2025-02-08 08:27:37,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 30 remaining) [2025-02-08 08:27:37,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 30 remaining) [2025-02-08 08:27:37,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 30 remaining) [2025-02-08 08:27:37,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 30 remaining) [2025-02-08 08:27:37,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 30 remaining) [2025-02-08 08:27:37,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 30 remaining) [2025-02-08 08:27:37,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 30 remaining) [2025-02-08 08:27:37,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:27:37,546 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 08:27:37,548 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:27:37,548 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 08:27:37,581 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:27:37,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 103 transitions, 234 flow [2025-02-08 08:27:37,593 INFO L124 PetriNetUnfolderBase]: 8/122 cut-off events. [2025-02-08 08:27:37,593 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 08:27:37,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 122 events. 8/122 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 464 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 105. Up to 5 conditions per place. [2025-02-08 08:27:37,594 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 103 transitions, 234 flow [2025-02-08 08:27:37,595 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 103 transitions, 234 flow [2025-02-08 08:27:37,596 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:27:37,597 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;@6c46598a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:27:37,597 INFO L334 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2025-02-08 08:27:37,598 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:27:37,598 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-08 08:27:37,599 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:27:37,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:37,599 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:27:37,599 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-02-08 08:27:37,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:37,599 INFO L85 PathProgramCache]: Analyzing trace with hash 448537, now seen corresponding path program 1 times [2025-02-08 08:27:37,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:37,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393836590] [2025-02-08 08:27:37,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:37,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:37,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:27:37,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:27:37,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:37,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:37,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:37,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:37,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393836590] [2025-02-08 08:27:37,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393836590] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:37,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:37,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:27:37,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643342457] [2025-02-08 08:27:37,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:37,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:27:37,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:37,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:27:37,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:27:37,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 103 [2025-02-08 08:27:37,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 103 transitions, 234 flow. Second operand has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 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-02-08 08:27:37,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:37,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 103 [2025-02-08 08:27:37,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:42,078 INFO L124 PetriNetUnfolderBase]: 43302/85880 cut-off events. [2025-02-08 08:27:42,079 INFO L125 PetriNetUnfolderBase]: For 6313/6313 co-relation queries the response was YES. [2025-02-08 08:27:42,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146072 conditions, 85880 events. 43302/85880 cut-off events. For 6313/6313 co-relation queries the response was YES. Maximal size of possible extension queue 3686. Compared 969225 event pairs, 43302 based on Foata normal form. 13395/89046 useless extension candidates. Maximal degree in co-relation 15159. Up to 57345 conditions per place. [2025-02-08 08:27:42,685 INFO L140 encePairwiseOnDemand]: 94/103 looper letters, 35 selfloop transitions, 0 changer transitions 0/88 dead transitions. [2025-02-08 08:27:42,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 88 transitions, 274 flow [2025-02-08 08:27:42,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:27:42,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:27:42,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 152 transitions. [2025-02-08 08:27:42,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7378640776699029 [2025-02-08 08:27:42,687 INFO L175 Difference]: Start difference. First operand has 104 places, 103 transitions, 234 flow. Second operand 2 states and 152 transitions. [2025-02-08 08:27:42,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 88 transitions, 274 flow [2025-02-08 08:27:42,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 88 transitions, 268 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-08 08:27:42,695 INFO L231 Difference]: Finished difference. Result has 98 places, 88 transitions, 198 flow [2025-02-08 08:27:42,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=198, PETRI_PLACES=98, PETRI_TRANSITIONS=88} [2025-02-08 08:27:42,696 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, -6 predicate places. [2025-02-08 08:27:42,696 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 88 transitions, 198 flow [2025-02-08 08:27:42,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 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-02-08 08:27:42,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:42,697 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:42,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:27:42,697 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-02-08 08:27:42,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:42,698 INFO L85 PathProgramCache]: Analyzing trace with hash -708272930, now seen corresponding path program 1 times [2025-02-08 08:27:42,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:42,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033356897] [2025-02-08 08:27:42,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:42,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:42,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:27:42,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:27:42,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:42,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:42,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:42,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:42,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033356897] [2025-02-08 08:27:42,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033356897] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:42,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:42,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:27:42,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677046324] [2025-02-08 08:27:42,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:42,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:27:42,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:42,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:27:42,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:27:42,789 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 103 [2025-02-08 08:27:42,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 88 transitions, 198 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-02-08 08:27:42,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:42,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 103 [2025-02-08 08:27:42,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:51,923 INFO L124 PetriNetUnfolderBase]: 106668/178463 cut-off events. [2025-02-08 08:27:51,923 INFO L125 PetriNetUnfolderBase]: For 4286/4286 co-relation queries the response was YES. [2025-02-08 08:27:52,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321802 conditions, 178463 events. 106668/178463 cut-off events. For 4286/4286 co-relation queries the response was YES. Maximal size of possible extension queue 5671. Compared 1767344 event pairs, 106668 based on Foata normal form. 0/176788 useless extension candidates. Maximal degree in co-relation 321795. Up to 140000 conditions per place. [2025-02-08 08:27:53,259 INFO L140 encePairwiseOnDemand]: 90/103 looper letters, 42 selfloop transitions, 1 changer transitions 0/76 dead transitions. [2025-02-08 08:27:53,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 76 transitions, 260 flow [2025-02-08 08:27:53,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:27:53,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:27:53,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2025-02-08 08:27:53,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5080906148867314 [2025-02-08 08:27:53,261 INFO L175 Difference]: Start difference. First operand has 98 places, 88 transitions, 198 flow. Second operand 3 states and 157 transitions. [2025-02-08 08:27:53,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 76 transitions, 260 flow [2025-02-08 08:27:53,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 76 transitions, 260 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:27:53,273 INFO L231 Difference]: Finished difference. Result has 88 places, 76 transitions, 176 flow [2025-02-08 08:27:53,273 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=88, PETRI_TRANSITIONS=76} [2025-02-08 08:27:53,273 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, -16 predicate places. [2025-02-08 08:27:53,273 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 76 transitions, 176 flow [2025-02-08 08:27:53,273 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-02-08 08:27:53,273 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:53,274 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:53,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:27:53,274 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-02-08 08:27:53,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:53,274 INFO L85 PathProgramCache]: Analyzing trace with hash -708272929, now seen corresponding path program 1 times [2025-02-08 08:27:53,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:53,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611569079] [2025-02-08 08:27:53,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:53,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:53,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:27:53,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:27:53,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:53,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:53,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:53,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:53,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611569079] [2025-02-08 08:27:53,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611569079] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:53,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:53,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:27:53,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151870109] [2025-02-08 08:27:53,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:53,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:27:53,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:53,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:27:53,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:27:53,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 103 [2025-02-08 08:27:53,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 76 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 51.5) internal successors, (309), 6 states have internal predecessors, (309), 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-02-08 08:27:53,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:53,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 103 [2025-02-08 08:27:53,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:02,760 INFO L124 PetriNetUnfolderBase]: 94396/177714 cut-off events. [2025-02-08 08:28:02,760 INFO L125 PetriNetUnfolderBase]: For 3635/3635 co-relation queries the response was YES. [2025-02-08 08:28:03,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306224 conditions, 177714 events. 94396/177714 cut-off events. For 3635/3635 co-relation queries the response was YES. Maximal size of possible extension queue 7519. Compared 2082986 event pairs, 32845 based on Foata normal form. 3510/166914 useless extension candidates. Maximal degree in co-relation 306216. Up to 67148 conditions per place. [2025-02-08 08:28:04,038 INFO L140 encePairwiseOnDemand]: 93/103 looper letters, 114 selfloop transitions, 12 changer transitions 0/163 dead transitions. [2025-02-08 08:28:04,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 163 transitions, 657 flow [2025-02-08 08:28:04,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:28:04,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:28:04,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 429 transitions. [2025-02-08 08:28:04,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6941747572815534 [2025-02-08 08:28:04,039 INFO L175 Difference]: Start difference. First operand has 88 places, 76 transitions, 176 flow. Second operand 6 states and 429 transitions. [2025-02-08 08:28:04,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 163 transitions, 657 flow [2025-02-08 08:28:04,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 163 transitions, 656 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:28:04,044 INFO L231 Difference]: Finished difference. Result has 96 places, 85 transitions, 255 flow [2025-02-08 08:28:04,044 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=255, PETRI_PLACES=96, PETRI_TRANSITIONS=85} [2025-02-08 08:28:04,044 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, -8 predicate places. [2025-02-08 08:28:04,044 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 85 transitions, 255 flow [2025-02-08 08:28:04,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.5) internal successors, (309), 6 states have internal predecessors, (309), 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-02-08 08:28:04,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:04,045 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:04,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:28:04,045 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thrErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-02-08 08:28:04,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:04,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1308855305, now seen corresponding path program 1 times [2025-02-08 08:28:04,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:04,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326227266] [2025-02-08 08:28:04,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:04,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:04,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:28:04,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:28:04,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:04,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:04,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:04,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:04,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326227266] [2025-02-08 08:28:04,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326227266] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:04,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:04,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:28:04,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799613131] [2025-02-08 08:28:04,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:04,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:28:04,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:04,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:28:04,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:28:04,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 103 [2025-02-08 08:28:04,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 85 transitions, 255 flow. Second operand has 6 states, 6 states have (on average 51.833333333333336) internal successors, (311), 6 states have internal predecessors, (311), 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-02-08 08:28:04,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:04,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 103 [2025-02-08 08:28:04,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand