./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-lit/sssc12_variant-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-lit/sssc12_variant-2.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 7be74b3f1207f4387a275e1f4e0e57734d5f1b215282bd8d49efde8c6948d207 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:52:56,346 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:52:56,380 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:52:56,384 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:52:56,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:52:56,398 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:52:56,399 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:52:56,399 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:52:56,399 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:52:56,399 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:52:56,399 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:52:56,399 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:52:56,400 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:52:56,400 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:52:56,400 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:52:56,400 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:52:56,400 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:52:56,400 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:52:56,400 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:52:56,400 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:52:56,400 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:52:56,400 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:52:56,400 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:52:56,400 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:52:56,400 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:52:56,400 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:52:56,400 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:52:56,400 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:52:56,401 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:52:56,401 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:52:56,401 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:52:56,401 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:52:56,401 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:52:56,401 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:52:56,401 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:52:56,401 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:52:56,401 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:52:56,401 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:52:56,401 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:52:56,401 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:52:56,401 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:52:56,401 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:52:56,401 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:52:56,401 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:52:56,401 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:52:56,401 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:52:56,402 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:52:56,402 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 -> 7be74b3f1207f4387a275e1f4e0e57734d5f1b215282bd8d49efde8c6948d207 [2025-01-10 00:52:56,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:52:56,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:52:56,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:52:56,644 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:52:56,645 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:52:56,645 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/sssc12_variant-2.i [2025-01-10 00:52:57,907 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/47fccbf1b/9bfdd086bed748d99a8985ea82f1fe7a/FLAGa0435dede [2025-01-10 00:52:58,258 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:52:58,259 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-lit/sssc12_variant-2.i [2025-01-10 00:52:58,279 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/47fccbf1b/9bfdd086bed748d99a8985ea82f1fe7a/FLAGa0435dede [2025-01-10 00:52:58,296 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/47fccbf1b/9bfdd086bed748d99a8985ea82f1fe7a [2025-01-10 00:52:58,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:52:58,304 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:52:58,308 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:52:58,309 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:52:58,316 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:52:58,317 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:52:58" (1/1) ... [2025-01-10 00:52:58,318 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35272c65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:58, skipping insertion in model container [2025-01-10 00:52:58,318 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:52:58" (1/1) ... [2025-01-10 00:52:58,349 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:52:58,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:52:58,830 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:52:58,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:52:58,916 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:52:58,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:58 WrapperNode [2025-01-10 00:52:58,917 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:52:58,918 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:52:58,918 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:52:58,918 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:52:58,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:58" (1/1) ... [2025-01-10 00:52:58,943 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:58" (1/1) ... [2025-01-10 00:52:58,961 INFO L138 Inliner]: procedures = 274, calls = 22, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 78 [2025-01-10 00:52:58,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:52:58,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:52:58,963 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:52:58,963 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:52:58,968 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:58" (1/1) ... [2025-01-10 00:52:58,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:58" (1/1) ... [2025-01-10 00:52:58,971 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:58" (1/1) ... [2025-01-10 00:52:58,986 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-01-10 00:52:58,987 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:58" (1/1) ... [2025-01-10 00:52:58,988 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:58" (1/1) ... [2025-01-10 00:52:58,994 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:58" (1/1) ... [2025-01-10 00:52:58,998 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:58" (1/1) ... [2025-01-10 00:52:59,001 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:58" (1/1) ... [2025-01-10 00:52:59,005 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:58" (1/1) ... [2025-01-10 00:52:59,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:58" (1/1) ... [2025-01-10 00:52:59,007 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:52:59,007 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:52:59,007 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:52:59,007 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:52:59,008 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:58" (1/1) ... [2025-01-10 00:52:59,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:52:59,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:52:59,039 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:52:59,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:52:59,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:52:59,072 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2025-01-10 00:52:59,072 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2025-01-10 00:52:59,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:52:59,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:52:59,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:52:59,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:52:59,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:52:59,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:52:59,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:52:59,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:52:59,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:52:59,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:52:59,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:52:59,075 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:52:59,178 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:52:59,180 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:52:59,327 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:52:59,327 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:52:59,402 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:52:59,402 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 00:52:59,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:52:59 BoogieIcfgContainer [2025-01-10 00:52:59,402 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:52:59,404 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:52:59,404 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:52:59,407 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:52:59,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:52:58" (1/3) ... [2025-01-10 00:52:59,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79563326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:52:59, skipping insertion in model container [2025-01-10 00:52:59,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:58" (2/3) ... [2025-01-10 00:52:59,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79563326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:52:59, skipping insertion in model container [2025-01-10 00:52:59,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:52:59" (3/3) ... [2025-01-10 00:52:59,409 INFO L128 eAbstractionObserver]: Analyzing ICFG sssc12_variant-2.i [2025-01-10 00:52:59,419 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:52:59,421 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sssc12_variant-2.i that has 2 procedures, 29 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-01-10 00:52:59,421 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:52:59,454 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:52:59,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 32 transitions, 68 flow [2025-01-10 00:52:59,500 INFO L124 PetriNetUnfolderBase]: 3/36 cut-off events. [2025-01-10 00:52:59,501 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:52:59,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 36 events. 3/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2025-01-10 00:52:59,503 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 32 transitions, 68 flow [2025-01-10 00:52:59,506 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 32 transitions, 68 flow [2025-01-10 00:52:59,512 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:52:59,520 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;@74dd2607, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:52:59,521 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-01-10 00:52:59,523 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:52:59,523 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-01-10 00:52:59,524 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:52:59,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:52:59,524 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:52:59,524 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-01-10 00:52:59,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:52:59,529 INFO L85 PathProgramCache]: Analyzing trace with hash 279925, now seen corresponding path program 1 times [2025-01-10 00:52:59,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:52:59,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735399007] [2025-01-10 00:52:59,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:52:59,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:52:59,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:52:59,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:52:59,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:52:59,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:52:59,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:52:59,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:52:59,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735399007] [2025-01-10 00:52:59,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735399007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:52:59,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:52:59,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:52:59,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261569791] [2025-01-10 00:52:59,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:52:59,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:52:59,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:52:59,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:52:59,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:52:59,664 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 32 [2025-01-10 00:52:59,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 32 transitions, 68 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-01-10 00:52:59,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:52:59,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 32 [2025-01-10 00:52:59,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:52:59,703 INFO L124 PetriNetUnfolderBase]: 17/83 cut-off events. [2025-01-10 00:52:59,703 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:52:59,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 83 events. 17/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 257 event pairs, 14 based on Foata normal form. 6/74 useless extension candidates. Maximal degree in co-relation 119. Up to 44 conditions per place. [2025-01-10 00:52:59,705 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 12 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2025-01-10 00:52:59,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 26 transitions, 80 flow [2025-01-10 00:52:59,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:52:59,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:52:59,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2025-01-10 00:52:59,714 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.703125 [2025-01-10 00:52:59,715 INFO L175 Difference]: Start difference. First operand has 32 places, 32 transitions, 68 flow. Second operand 2 states and 45 transitions. [2025-01-10 00:52:59,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 26 transitions, 80 flow [2025-01-10 00:52:59,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 26 transitions, 80 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:52:59,720 INFO L231 Difference]: Finished difference. Result has 29 places, 26 transitions, 56 flow [2025-01-10 00:52:59,721 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=29, PETRI_TRANSITIONS=26} [2025-01-10 00:52:59,724 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, -3 predicate places. [2025-01-10 00:52:59,724 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 26 transitions, 56 flow [2025-01-10 00:52:59,724 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-01-10 00:52:59,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:52:59,724 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 00:52:59,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:52:59,724 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-01-10 00:52:59,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:52:59,725 INFO L85 PathProgramCache]: Analyzing trace with hash -250310966, now seen corresponding path program 1 times [2025-01-10 00:52:59,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:52:59,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961485217] [2025-01-10 00:52:59,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:52:59,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:52:59,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:52:59,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:52:59,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:52:59,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:52:59,744 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:52:59,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:52:59,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:52:59,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:52:59,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:52:59,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:52:59,798 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:52:59,799 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-01-10 00:52:59,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2025-01-10 00:52:59,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2025-01-10 00:52:59,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2025-01-10 00:52:59,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2025-01-10 00:52:59,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2025-01-10 00:52:59,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2025-01-10 00:52:59,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2025-01-10 00:52:59,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONMEMORY_LEAK (7 of 16 remaining) [2025-01-10 00:52:59,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2025-01-10 00:52:59,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2025-01-10 00:52:59,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2025-01-10 00:52:59,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 16 remaining) [2025-01-10 00:52:59,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 16 remaining) [2025-01-10 00:52:59,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2025-01-10 00:52:59,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2025-01-10 00:52:59,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:52:59,802 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-10 00:52:59,804 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:52:59,804 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 00:52:59,829 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:52:59,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 57 transitions, 124 flow [2025-01-10 00:52:59,841 INFO L124 PetriNetUnfolderBase]: 6/66 cut-off events. [2025-01-10 00:52:59,841 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:52:59,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 66 events. 6/66 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 185 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 53. Up to 3 conditions per place. [2025-01-10 00:52:59,842 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 57 transitions, 124 flow [2025-01-10 00:52:59,843 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 57 transitions, 124 flow [2025-01-10 00:52:59,844 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:52:59,844 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;@74dd2607, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:52:59,844 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-01-10 00:52:59,846 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:52:59,846 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-01-10 00:52:59,846 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:52:59,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:52:59,846 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:52:59,847 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-10 00:52:59,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:52:59,847 INFO L85 PathProgramCache]: Analyzing trace with hash 336526, now seen corresponding path program 1 times [2025-01-10 00:52:59,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:52:59,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675195475] [2025-01-10 00:52:59,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:52:59,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:52:59,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:52:59,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:52:59,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:52:59,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:52:59,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:52:59,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:52:59,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675195475] [2025-01-10 00:52:59,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675195475] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:52:59,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:52:59,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:52:59,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164124918] [2025-01-10 00:52:59,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:52:59,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:52:59,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:52:59,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:52:59,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:52:59,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 57 [2025-01-10 00:52:59,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 57 transitions, 124 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-01-10 00:52:59,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:52:59,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 57 [2025-01-10 00:52:59,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:00,040 INFO L124 PetriNetUnfolderBase]: 409/1275 cut-off events. [2025-01-10 00:53:00,041 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-01-10 00:53:00,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1956 conditions, 1275 events. 409/1275 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 8912 event pairs, 325 based on Foata normal form. 114/1104 useless extension candidates. Maximal degree in co-relation 1448. Up to 652 conditions per place. [2025-01-10 00:53:00,058 INFO L140 encePairwiseOnDemand]: 52/57 looper letters, 21 selfloop transitions, 0 changer transitions 0/48 dead transitions. [2025-01-10 00:53:00,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 48 transitions, 148 flow [2025-01-10 00:53:00,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:53:00,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:53:00,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 82 transitions. [2025-01-10 00:53:00,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7192982456140351 [2025-01-10 00:53:00,061 INFO L175 Difference]: Start difference. First operand has 56 places, 57 transitions, 124 flow. Second operand 2 states and 82 transitions. [2025-01-10 00:53:00,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 48 transitions, 148 flow [2025-01-10 00:53:00,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 48 transitions, 148 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:53:00,063 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 106 flow [2025-01-10 00:53:00,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=106, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2025-01-10 00:53:00,066 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -4 predicate places. [2025-01-10 00:53:00,066 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 106 flow [2025-01-10 00:53:00,066 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-01-10 00:53:00,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:00,066 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-01-10 00:53:00,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:53:00,066 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-10 00:53:00,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:00,067 INFO L85 PathProgramCache]: Analyzing trace with hash 220104457, now seen corresponding path program 1 times [2025-01-10 00:53:00,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:00,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425610670] [2025-01-10 00:53:00,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:53:00,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:00,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:53:00,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:53:00,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:00,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:53:00,097 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:53:00,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:53:00,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:53:00,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:00,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:53:00,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:53:00,136 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:53:00,137 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-01-10 00:53:00,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (21 of 23 remaining) [2025-01-10 00:53:00,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 23 remaining) [2025-01-10 00:53:00,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 23 remaining) [2025-01-10 00:53:00,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 23 remaining) [2025-01-10 00:53:00,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 23 remaining) [2025-01-10 00:53:00,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 23 remaining) [2025-01-10 00:53:00,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 23 remaining) [2025-01-10 00:53:00,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONMEMORY_LEAK (14 of 23 remaining) [2025-01-10 00:53:00,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 23 remaining) [2025-01-10 00:53:00,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 23 remaining) [2025-01-10 00:53:00,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 23 remaining) [2025-01-10 00:53:00,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 23 remaining) [2025-01-10 00:53:00,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 23 remaining) [2025-01-10 00:53:00,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 23 remaining) [2025-01-10 00:53:00,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONMEMORY_LEAK (7 of 23 remaining) [2025-01-10 00:53:00,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 23 remaining) [2025-01-10 00:53:00,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 23 remaining) [2025-01-10 00:53:00,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 23 remaining) [2025-01-10 00:53:00,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 23 remaining) [2025-01-10 00:53:00,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 23 remaining) [2025-01-10 00:53:00,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 23 remaining) [2025-01-10 00:53:00,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONMEMORY_LEAK (0 of 23 remaining) [2025-01-10 00:53:00,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:53:00,142 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-10 00:53:00,142 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:53:00,142 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 00:53:00,185 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:53:00,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 82 transitions, 182 flow [2025-01-10 00:53:00,194 INFO L124 PetriNetUnfolderBase]: 9/96 cut-off events. [2025-01-10 00:53:00,194 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 00:53:00,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 96 events. 9/96 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 313 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. [2025-01-10 00:53:00,195 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 82 transitions, 182 flow [2025-01-10 00:53:00,196 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 82 transitions, 182 flow [2025-01-10 00:53:00,198 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:53:00,199 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;@74dd2607, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:53:00,199 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-01-10 00:53:00,200 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:53:00,200 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-01-10 00:53:00,201 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:53:00,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:00,202 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:53:00,202 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 00:53:00,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:00,203 INFO L85 PathProgramCache]: Analyzing trace with hash 417952, now seen corresponding path program 1 times [2025-01-10 00:53:00,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:00,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471507032] [2025-01-10 00:53:00,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:53:00,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:00,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:53:00,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:53:00,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:00,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:00,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:53:00,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:00,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471507032] [2025-01-10 00:53:00,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471507032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:00,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:00,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:53:00,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479541454] [2025-01-10 00:53:00,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:00,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:53:00,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:00,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:53:00,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:53:00,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 82 [2025-01-10 00:53:00,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 82 transitions, 182 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-01-10 00:53:00,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:00,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 82 [2025-01-10 00:53:00,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:01,594 INFO L124 PetriNetUnfolderBase]: 6301/15930 cut-off events. [2025-01-10 00:53:01,595 INFO L125 PetriNetUnfolderBase]: For 508/508 co-relation queries the response was YES. [2025-01-10 00:53:01,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24790 conditions, 15930 events. 6301/15930 cut-off events. For 508/508 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 165911 event pairs, 4948 based on Foata normal form. 1572/13856 useless extension candidates. Maximal degree in co-relation 7164. Up to 8542 conditions per place. [2025-01-10 00:53:01,711 INFO L140 encePairwiseOnDemand]: 75/82 looper letters, 30 selfloop transitions, 0 changer transitions 0/70 dead transitions. [2025-01-10 00:53:01,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 70 transitions, 218 flow [2025-01-10 00:53:01,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:53:01,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:53:01,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 119 transitions. [2025-01-10 00:53:01,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.725609756097561 [2025-01-10 00:53:01,715 INFO L175 Difference]: Start difference. First operand has 80 places, 82 transitions, 182 flow. Second operand 2 states and 119 transitions. [2025-01-10 00:53:01,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 70 transitions, 218 flow [2025-01-10 00:53:01,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 70 transitions, 216 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-10 00:53:01,718 INFO L231 Difference]: Finished difference. Result has 75 places, 70 transitions, 156 flow [2025-01-10 00:53:01,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=156, PETRI_PLACES=75, PETRI_TRANSITIONS=70} [2025-01-10 00:53:01,719 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -5 predicate places. [2025-01-10 00:53:01,720 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 70 transitions, 156 flow [2025-01-10 00:53:01,720 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-01-10 00:53:01,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:01,720 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:53:01,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:53:01,720 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 00:53:01,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:01,721 INFO L85 PathProgramCache]: Analyzing trace with hash -660169703, now seen corresponding path program 1 times [2025-01-10 00:53:01,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:01,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619945134] [2025-01-10 00:53:01,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:53:01,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:01,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:53:01,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:53:01,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:01,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:01,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:53:01,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:01,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619945134] [2025-01-10 00:53:01,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619945134] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:01,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:01,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:53:01,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060909341] [2025-01-10 00:53:01,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:01,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:53:01,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:01,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:53:01,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:53:01,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 82 [2025-01-10 00:53:01,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 70 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:53:01,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:01,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 82 [2025-01-10 00:53:01,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:03,050 INFO L124 PetriNetUnfolderBase]: 11513/20722 cut-off events. [2025-01-10 00:53:03,050 INFO L125 PetriNetUnfolderBase]: For 421/421 co-relation queries the response was YES. [2025-01-10 00:53:03,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36718 conditions, 20722 events. 11513/20722 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 723. Compared 168441 event pairs, 9521 based on Foata normal form. 0/20537 useless extension candidates. Maximal degree in co-relation 36712. Up to 15622 conditions per place. [2025-01-10 00:53:03,186 INFO L140 encePairwiseOnDemand]: 72/82 looper letters, 35 selfloop transitions, 1 changer transitions 0/61 dead transitions. [2025-01-10 00:53:03,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 61 transitions, 210 flow [2025-01-10 00:53:03,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:53:03,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:53:03,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2025-01-10 00:53:03,190 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-01-10 00:53:03,190 INFO L175 Difference]: Start difference. First operand has 75 places, 70 transitions, 156 flow. Second operand 3 states and 123 transitions. [2025-01-10 00:53:03,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 61 transitions, 210 flow [2025-01-10 00:53:03,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 61 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:53:03,194 INFO L231 Difference]: Finished difference. Result has 68 places, 61 transitions, 140 flow [2025-01-10 00:53:03,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=68, PETRI_TRANSITIONS=61} [2025-01-10 00:53:03,195 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -12 predicate places. [2025-01-10 00:53:03,195 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 61 transitions, 140 flow [2025-01-10 00:53:03,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:53:03,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:03,195 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:53:03,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:53:03,197 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 00:53:03,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:03,197 INFO L85 PathProgramCache]: Analyzing trace with hash -660169702, now seen corresponding path program 1 times [2025-01-10 00:53:03,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:03,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328567948] [2025-01-10 00:53:03,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:53:03,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:03,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:53:03,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:53:03,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:03,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:53:03,232 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:53:03,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:53:03,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:53:03,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:03,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:53:03,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:53:03,266 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:53:03,266 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 30 remaining) [2025-01-10 00:53:03,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (28 of 30 remaining) [2025-01-10 00:53:03,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 30 remaining) [2025-01-10 00:53:03,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 30 remaining) [2025-01-10 00:53:03,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 30 remaining) [2025-01-10 00:53:03,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 30 remaining) [2025-01-10 00:53:03,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 30 remaining) [2025-01-10 00:53:03,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 30 remaining) [2025-01-10 00:53:03,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 30 remaining) [2025-01-10 00:53:03,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONMEMORY_LEAK (20 of 30 remaining) [2025-01-10 00:53:03,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 30 remaining) [2025-01-10 00:53:03,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 30 remaining) [2025-01-10 00:53:03,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 30 remaining) [2025-01-10 00:53:03,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 30 remaining) [2025-01-10 00:53:03,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 30 remaining) [2025-01-10 00:53:03,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONMEMORY_LEAK (14 of 30 remaining) [2025-01-10 00:53:03,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 30 remaining) [2025-01-10 00:53:03,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 30 remaining) [2025-01-10 00:53:03,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 30 remaining) [2025-01-10 00:53:03,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 30 remaining) [2025-01-10 00:53:03,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 30 remaining) [2025-01-10 00:53:03,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 30 remaining) [2025-01-10 00:53:03,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONMEMORY_LEAK (7 of 30 remaining) [2025-01-10 00:53:03,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 30 remaining) [2025-01-10 00:53:03,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 30 remaining) [2025-01-10 00:53:03,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 30 remaining) [2025-01-10 00:53:03,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 30 remaining) [2025-01-10 00:53:03,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 30 remaining) [2025-01-10 00:53:03,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 30 remaining) [2025-01-10 00:53:03,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONMEMORY_LEAK (0 of 30 remaining) [2025-01-10 00:53:03,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:53:03,268 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-10 00:53:03,320 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2025-01-10 00:53:03,320 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:53:03,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:53:03 BasicIcfg [2025-01-10 00:53:03,336 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:53:03,337 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:53:03,337 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:53:03,337 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:53:03,338 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:52:59" (3/4) ... [2025-01-10 00:53:03,339 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-10 00:53:03,382 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 16. [2025-01-10 00:53:03,419 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 00:53:03,419 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 00:53:03,419 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:53:03,420 INFO L158 Benchmark]: Toolchain (without parser) took 5116.00ms. Allocated memory was 167.8MB in the beginning and 889.2MB in the end (delta: 721.4MB). Free memory was 122.0MB in the beginning and 413.3MB in the end (delta: -291.3MB). Peak memory consumption was 427.5MB. Max. memory is 16.1GB. [2025-01-10 00:53:03,420 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:53:03,420 INFO L158 Benchmark]: CACSL2BoogieTranslator took 609.07ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 94.0MB in the end (delta: 28.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 00:53:03,420 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.39ms. Allocated memory is still 167.8MB. Free memory was 94.0MB in the beginning and 91.4MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:53:03,420 INFO L158 Benchmark]: Boogie Preprocessor took 43.92ms. Allocated memory is still 167.8MB. Free memory was 91.4MB in the beginning and 89.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:53:03,421 INFO L158 Benchmark]: RCFGBuilder took 395.18ms. Allocated memory is still 167.8MB. Free memory was 89.7MB in the beginning and 63.7MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 00:53:03,421 INFO L158 Benchmark]: TraceAbstraction took 3932.72ms. Allocated memory was 167.8MB in the beginning and 889.2MB in the end (delta: 721.4MB). Free memory was 63.7MB in the beginning and 421.7MB in the end (delta: -357.9MB). Peak memory consumption was 360.4MB. Max. memory is 16.1GB. [2025-01-10 00:53:03,421 INFO L158 Benchmark]: Witness Printer took 81.99ms. Allocated memory is still 889.2MB. Free memory was 421.7MB in the beginning and 413.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:53:03,422 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 609.07ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 94.0MB in the end (delta: 28.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.39ms. Allocated memory is still 167.8MB. Free memory was 94.0MB in the beginning and 91.4MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.92ms. Allocated memory is still 167.8MB. Free memory was 91.4MB in the beginning and 89.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 395.18ms. Allocated memory is still 167.8MB. Free memory was 89.7MB in the beginning and 63.7MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3932.72ms. Allocated memory was 167.8MB in the beginning and 889.2MB in the end (delta: 721.4MB). Free memory was 63.7MB in the beginning and 421.7MB in the end (delta: -357.9MB). Peak memory consumption was 360.4MB. Max. memory is 16.1GB. * Witness Printer took 81.99ms. Allocated memory is still 889.2MB. Free memory was 421.7MB in the beginning and 413.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1005] 0 int *data; [L1006] 0 volatile int len; [L1007] 0 volatile int next; [L1008] 0 volatile int lock; [L1040] 0 pthread_t t; [L1041] 0 lock=0 [L1042] 0 next = 0 [L1043] 0 len = __VERIFIER_nondet_int() [L1044] CALL 0 assume_abort_if_not(len > 0) [L994] COND FALSE 0 !(!cond) [L1044] RET 0 assume_abort_if_not(len > 0) [L1045] 0 data = malloc(sizeof(int) * len) [L1047] FCALL, FORK 0 pthread_create(&t, 0, thr, 0) VAL [\old(argc)=1073741827, \old(argv)={1073741825:1073741826}, argc=1073741827, data={-1:0}, len=1073741824, lock=0, next=0, t=0] [L1022] 1 int c, end; [L1023] 1 c = 0 [L1024] 1 end = 0 [L1025] CALL 1 acquire() [L1011] CALL 1 assume_abort_if_not(lock == 0) [L994] COND FALSE 1 !(!cond) [L1011] RET 1 assume_abort_if_not(lock == 0) [L1012] 1 lock = 1 VAL [data={-1:0}, len=1073741824, lock=1, next=0] [L1025] RET 1 acquire() [L1026] COND TRUE 1 next + 10 <= len [L1027] 1 c = next [L1028] EXPR 1 end = next + 10 [L1028] 1 next = end = next + 10 [L1030] CALL 1 release() [L1017] CALL 1 assume_abort_if_not(lock == 1) [L994] COND FALSE 1 !(!cond) [L1017] RET 1 assume_abort_if_not(lock == 1) [L1018] 1 lock = 0 VAL [data={-1:0}, len=1073741824, lock=0, next=10] [L1030] RET 1 release() [L1031] COND TRUE 1 c < end VAL [data={-1:0}, len=1073741824, lock=0, next=10] [L1032] 1 data[c] = 0 - UnprovableResult [Line: 1039]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 991]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 52 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 0.3s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12 IncrementalHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 0 mSDtfsCounter, 12 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 9 NumberOfCodeBlocks, 9 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 2 ConstructedInterpolants, 0 QuantifiedInterpolants, 2 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 74 locations, 23 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 0.3s, OverallIterations: 2, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21 IncrementalHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 0 mSDtfsCounter, 21 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 2 ConstructedInterpolants, 0 QuantifiedInterpolants, 2 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 96 locations, 30 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.1s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 84 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 95 IncrementalHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 25 mSDtfsCounter, 95 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=182occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 47 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-10 00:53:03,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)