./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_06-cond_racing1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_06-cond_racing1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 830cb16a3cbc120e059f0ed7638e33ed20360a11f425952cf536aa3d659b86fc --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 16:17:53,154 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 16:17:53,226 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 16:17:53,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 16:17:53,233 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 16:17:53,258 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 16:17:53,258 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 16:17:53,259 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 16:17:53,259 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 16:17:53,260 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 16:17:53,260 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 16:17:53,261 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 16:17:53,261 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 16:17:53,262 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 16:17:53,262 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 16:17:53,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 16:17:53,263 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 16:17:53,263 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 16:17:53,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 16:17:53,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 16:17:53,264 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 16:17:53,265 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 16:17:53,265 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 16:17:53,266 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 16:17:53,266 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 16:17:53,266 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 16:17:53,267 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 16:17:53,267 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 16:17:53,267 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 16:17:53,268 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 16:17:53,268 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 16:17:53,268 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 16:17:53,269 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 16:17:53,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:17:53,270 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 16:17:53,270 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 16:17:53,270 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 16:17:53,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 16:17:53,271 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 16:17:53,271 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 16:17:53,271 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 16:17:53,272 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 16:17:53,273 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> 830cb16a3cbc120e059f0ed7638e33ed20360a11f425952cf536aa3d659b86fc [2024-11-12 16:17:53,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 16:17:53,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 16:17:53,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 16:17:53,571 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 16:17:53,571 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 16:17:53,572 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_06-cond_racing1.i [2024-11-12 16:17:55,127 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 16:17:55,410 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 16:17:55,410 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_06-cond_racing1.i [2024-11-12 16:17:55,428 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92c01f73d/fbbf15d322a947d79d321a791b2c85af/FLAG4c35193b5 [2024-11-12 16:17:55,442 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92c01f73d/fbbf15d322a947d79d321a791b2c85af [2024-11-12 16:17:55,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 16:17:55,447 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 16:17:55,448 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 16:17:55,448 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 16:17:55,454 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 16:17:55,455 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:17:55" (1/1) ... [2024-11-12 16:17:55,456 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57b0c096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:17:55, skipping insertion in model container [2024-11-12 16:17:55,456 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:17:55" (1/1) ... [2024-11-12 16:17:55,502 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 16:17:56,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:17:56,071 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 16:17:56,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:17:56,218 INFO L204 MainTranslator]: Completed translation [2024-11-12 16:17:56,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:17:56 WrapperNode [2024-11-12 16:17:56,218 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 16:17:56,220 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 16:17:56,220 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 16:17:56,221 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 16:17:56,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:17:56" (1/1) ... [2024-11-12 16:17:56,248 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:17:56" (1/1) ... [2024-11-12 16:17:56,281 INFO L138 Inliner]: procedures = 271, calls = 42, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2024-11-12 16:17:56,284 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 16:17:56,285 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 16:17:56,285 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 16:17:56,285 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 16:17:56,298 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:17:56" (1/1) ... [2024-11-12 16:17:56,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:17:56" (1/1) ... [2024-11-12 16:17:56,307 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:17:56" (1/1) ... [2024-11-12 16:17:56,337 INFO L175 MemorySlicer]: Split 19 memory accesses to 5 slices as follows [2, 5, 5, 5, 2]. 26 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 0, 1]. [2024-11-12 16:17:56,337 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:17:56" (1/1) ... [2024-11-12 16:17:56,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:17:56" (1/1) ... [2024-11-12 16:17:56,352 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:17:56" (1/1) ... [2024-11-12 16:17:56,359 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:17:56" (1/1) ... [2024-11-12 16:17:56,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:17:56" (1/1) ... [2024-11-12 16:17:56,366 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:17:56" (1/1) ... [2024-11-12 16:17:56,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 16:17:56,406 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 16:17:56,407 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 16:17:56,407 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 16:17:56,408 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:17:56" (1/1) ... [2024-11-12 16:17:56,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:17:56,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:17:56,507 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 16:17:56,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 16:17:56,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 16:17:56,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 16:17:56,569 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-12 16:17:56,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 16:17:56,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 16:17:56,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 16:17:56,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-12 16:17:56,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-12 16:17:56,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 16:17:56,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 16:17:56,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 16:17:56,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-12 16:17:56,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-12 16:17:56,571 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-12 16:17:56,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 16:17:56,572 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-12 16:17:56,572 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-12 16:17:56,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 16:17:56,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 16:17:56,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 16:17:56,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-12 16:17:56,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-12 16:17:56,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 16:17:56,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 16:17:56,576 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 16:17:56,711 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 16:17:56,714 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 16:17:56,989 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 16:17:56,989 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 16:17:57,182 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 16:17:57,182 INFO L316 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-12 16:17:57,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:17:57 BoogieIcfgContainer [2024-11-12 16:17:57,184 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 16:17:57,186 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 16:17:57,187 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 16:17:57,190 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 16:17:57,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:17:55" (1/3) ... [2024-11-12 16:17:57,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb0d175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:17:57, skipping insertion in model container [2024-11-12 16:17:57,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:17:56" (2/3) ... [2024-11-12 16:17:57,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb0d175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:17:57, skipping insertion in model container [2024-11-12 16:17:57,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:17:57" (3/3) ... [2024-11-12 16:17:57,195 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_06-cond_racing1.i [2024-11-12 16:17:57,209 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 16:17:57,209 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-12 16:17:57,209 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 16:17:57,256 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-12 16:17:57,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 67 transitions, 141 flow [2024-11-12 16:17:57,347 INFO L124 PetriNetUnfolderBase]: 21/105 cut-off events. [2024-11-12 16:17:57,349 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-12 16:17:57,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 105 events. 21/105 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 379 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 62. Up to 6 conditions per place. [2024-11-12 16:17:57,354 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 67 transitions, 141 flow [2024-11-12 16:17:57,358 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 67 transitions, 141 flow [2024-11-12 16:17:57,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 16:17:57,381 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;@30b8572a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 16:17:57,382 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-12 16:17:57,388 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 16:17:57,392 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-12 16:17:57,392 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 16:17:57,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:17:57,393 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-12 16:17:57,394 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-12 16:17:57,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:17:57,402 INFO L85 PathProgramCache]: Analyzing trace with hash 369886, now seen corresponding path program 1 times [2024-11-12 16:17:57,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:17:57,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192015870] [2024-11-12 16:17:57,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:17:57,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:17:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:17:57,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:17:57,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:17:57,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192015870] [2024-11-12 16:17:57,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192015870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:17:57,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:17:57,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 16:17:57,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132200256] [2024-11-12 16:17:57,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:17:57,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:17:57,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:17:57,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:17:57,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:17:57,838 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 67 [2024-11-12 16:17:57,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 67 transitions, 141 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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) [2024-11-12 16:17:57,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:17:57,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 67 [2024-11-12 16:17:57,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:17:58,093 INFO L124 PetriNetUnfolderBase]: 179/511 cut-off events. [2024-11-12 16:17:58,093 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-12 16:17:58,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 871 conditions, 511 events. 179/511 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2727 event pairs, 120 based on Foata normal form. 97/577 useless extension candidates. Maximal degree in co-relation 808. Up to 307 conditions per place. [2024-11-12 16:17:58,099 INFO L140 encePairwiseOnDemand]: 53/67 looper letters, 35 selfloop transitions, 2 changer transitions 1/63 dead transitions. [2024-11-12 16:17:58,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 63 transitions, 209 flow [2024-11-12 16:17:58,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:17:58,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:17:58,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2024-11-12 16:17:58,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6517412935323383 [2024-11-12 16:17:58,113 INFO L175 Difference]: Start difference. First operand has 56 places, 67 transitions, 141 flow. Second operand 3 states and 131 transitions. [2024-11-12 16:17:58,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 63 transitions, 209 flow [2024-11-12 16:17:58,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 63 transitions, 209 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 16:17:58,119 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 117 flow [2024-11-12 16:17:58,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2024-11-12 16:17:58,126 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places. [2024-11-12 16:17:58,128 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 117 flow [2024-11-12 16:17:58,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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) [2024-11-12 16:17:58,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:17:58,129 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-12 16:17:58,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 16:17:58,130 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-12 16:17:58,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:17:58,131 INFO L85 PathProgramCache]: Analyzing trace with hash 369887, now seen corresponding path program 1 times [2024-11-12 16:17:58,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:17:58,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414940734] [2024-11-12 16:17:58,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:17:58,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:17:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:17:58,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:17:58,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:17:58,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414940734] [2024-11-12 16:17:58,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414940734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:17:58,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:17:58,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 16:17:58,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294322807] [2024-11-12 16:17:58,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:17:58,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:17:58,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:17:58,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:17:58,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:17:58,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 67 [2024-11-12 16:17:58,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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) [2024-11-12 16:17:58,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:17:58,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 67 [2024-11-12 16:17:58,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:17:58,487 INFO L124 PetriNetUnfolderBase]: 141/445 cut-off events. [2024-11-12 16:17:58,487 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-11-12 16:17:58,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 445 events. 141/445 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2417 event pairs, 61 based on Foata normal form. 1/405 useless extension candidates. Maximal degree in co-relation 712. Up to 267 conditions per place. [2024-11-12 16:17:58,493 INFO L140 encePairwiseOnDemand]: 63/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2024-11-12 16:17:58,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 63 transitions, 211 flow [2024-11-12 16:17:58,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:17:58,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:17:58,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2024-11-12 16:17:58,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6119402985074627 [2024-11-12 16:17:58,499 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 117 flow. Second operand 3 states and 123 transitions. [2024-11-12 16:17:58,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 63 transitions, 211 flow [2024-11-12 16:17:58,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 63 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:17:58,505 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 123 flow [2024-11-12 16:17:58,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2024-11-12 16:17:58,506 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places. [2024-11-12 16:17:58,507 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 123 flow [2024-11-12 16:17:58,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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) [2024-11-12 16:17:58,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:17:58,508 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-12 16:17:58,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 16:17:58,510 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-12 16:17:58,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:17:58,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1988286292, now seen corresponding path program 1 times [2024-11-12 16:17:58,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:17:58,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92600100] [2024-11-12 16:17:58,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:17:58,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:17:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:17:58,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:17:58,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:17:58,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92600100] [2024-11-12 16:17:58,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92600100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:17:58,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:17:58,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:17:58,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402495585] [2024-11-12 16:17:58,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:17:58,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:17:58,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:17:58,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:17:58,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:17:58,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 67 [2024-11-12 16:17:58,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 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) [2024-11-12 16:17:58,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:17:58,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 67 [2024-11-12 16:17:58,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:17:58,811 INFO L124 PetriNetUnfolderBase]: 27/100 cut-off events. [2024-11-12 16:17:58,813 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-11-12 16:17:58,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 100 events. 27/100 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 225 event pairs, 18 based on Foata normal form. 20/119 useless extension candidates. Maximal degree in co-relation 179. Up to 57 conditions per place. [2024-11-12 16:17:58,815 INFO L140 encePairwiseOnDemand]: 63/67 looper letters, 23 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2024-11-12 16:17:58,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 34 transitions, 128 flow [2024-11-12 16:17:58,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:17:58,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:17:58,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2024-11-12 16:17:58,817 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.503731343283582 [2024-11-12 16:17:58,817 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 123 flow. Second operand 4 states and 135 transitions. [2024-11-12 16:17:58,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 34 transitions, 128 flow [2024-11-12 16:17:58,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 34 transitions, 122 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-12 16:17:58,818 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 54 flow [2024-11-12 16:17:58,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=54, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2024-11-12 16:17:58,819 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -27 predicate places. [2024-11-12 16:17:58,819 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 54 flow [2024-11-12 16:17:58,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 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) [2024-11-12 16:17:58,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:17:58,821 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1] [2024-11-12 16:17:58,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 16:17:58,822 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-12 16:17:58,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:17:58,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1507332563, now seen corresponding path program 1 times [2024-11-12 16:17:58,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:17:58,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862367315] [2024-11-12 16:17:58,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:17:58,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:17:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 16:17:58,866 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 16:17:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 16:17:58,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 16:17:58,918 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 16:17:58,920 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-12 16:17:58,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2024-11-12 16:17:58,922 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2024-11-12 16:17:58,922 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (3 of 7 remaining) [2024-11-12 16:17:58,923 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2024-11-12 16:17:58,923 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 7 remaining) [2024-11-12 16:17:58,923 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-12 16:17:58,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 16:17:58,925 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-12 16:17:58,927 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-12 16:17:58,927 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-12 16:17:58,954 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-12 16:17:58,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 92 transitions, 200 flow [2024-11-12 16:17:58,975 INFO L124 PetriNetUnfolderBase]: 36/180 cut-off events. [2024-11-12 16:17:58,975 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-12 16:17:58,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 180 events. 36/180 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 748 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 109. Up to 9 conditions per place. [2024-11-12 16:17:58,980 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 92 transitions, 200 flow [2024-11-12 16:17:58,982 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 92 transitions, 200 flow [2024-11-12 16:17:58,983 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 16:17:58,988 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;@30b8572a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 16:17:58,988 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-12 16:17:58,990 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 16:17:58,990 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-12 16:17:58,990 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 16:17:58,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:17:58,990 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-12 16:17:58,990 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-12 16:17:58,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:17:58,992 INFO L85 PathProgramCache]: Analyzing trace with hash 461242, now seen corresponding path program 1 times [2024-11-12 16:17:58,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:17:58,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230958280] [2024-11-12 16:17:58,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:17:58,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:17:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:17:59,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:17:59,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:17:59,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230958280] [2024-11-12 16:17:59,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230958280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:17:59,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:17:59,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 16:17:59,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781819352] [2024-11-12 16:17:59,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:17:59,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:17:59,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:17:59,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:17:59,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:17:59,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 92 [2024-11-12 16:17:59,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 92 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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) [2024-11-12 16:17:59,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:17:59,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 92 [2024-11-12 16:17:59,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:17:59,857 INFO L124 PetriNetUnfolderBase]: 3559/6891 cut-off events. [2024-11-12 16:17:59,858 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-11-12 16:17:59,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12422 conditions, 6891 events. 3559/6891 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 52391 event pairs, 2735 based on Foata normal form. 1720/8315 useless extension candidates. Maximal degree in co-relation 9137. Up to 4731 conditions per place. [2024-11-12 16:17:59,912 INFO L140 encePairwiseOnDemand]: 72/92 looper letters, 55 selfloop transitions, 2 changer transitions 1/91 dead transitions. [2024-11-12 16:17:59,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 91 transitions, 314 flow [2024-11-12 16:17:59,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:17:59,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:17:59,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2024-11-12 16:17:59,915 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.677536231884058 [2024-11-12 16:17:59,917 INFO L175 Difference]: Start difference. First operand has 76 places, 92 transitions, 200 flow. Second operand 3 states and 187 transitions. [2024-11-12 16:17:59,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 91 transitions, 314 flow [2024-11-12 16:17:59,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 91 transitions, 314 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 16:17:59,922 INFO L231 Difference]: Finished difference. Result has 75 places, 72 transitions, 164 flow [2024-11-12 16:17:59,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=75, PETRI_TRANSITIONS=72} [2024-11-12 16:17:59,924 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -1 predicate places. [2024-11-12 16:17:59,924 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 72 transitions, 164 flow [2024-11-12 16:17:59,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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) [2024-11-12 16:17:59,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:17:59,925 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-12 16:17:59,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 16:17:59,925 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-12 16:17:59,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:17:59,928 INFO L85 PathProgramCache]: Analyzing trace with hash 461243, now seen corresponding path program 1 times [2024-11-12 16:17:59,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:17:59,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143045575] [2024-11-12 16:17:59,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:17:59,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:17:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:18:00,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:18:00,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:18:00,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143045575] [2024-11-12 16:18:00,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143045575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:18:00,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:18:00,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 16:18:00,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197148291] [2024-11-12 16:18:00,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:18:00,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:18:00,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:18:00,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:18:00,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:18:00,069 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 92 [2024-11-12 16:18:00,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 72 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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) [2024-11-12 16:18:00,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:18:00,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 92 [2024-11-12 16:18:00,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:18:00,689 INFO L124 PetriNetUnfolderBase]: 2998/6181 cut-off events. [2024-11-12 16:18:00,690 INFO L125 PetriNetUnfolderBase]: For 318/318 co-relation queries the response was YES. [2024-11-12 16:18:00,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11022 conditions, 6181 events. 2998/6181 cut-off events. For 318/318 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 49078 event pairs, 1227 based on Foata normal form. 1/5817 useless extension candidates. Maximal degree in co-relation 9944. Up to 4562 conditions per place. [2024-11-12 16:18:00,734 INFO L140 encePairwiseOnDemand]: 88/92 looper letters, 47 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2024-11-12 16:18:00,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 83 transitions, 284 flow [2024-11-12 16:18:00,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:18:00,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:18:00,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2024-11-12 16:18:00,738 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5760869565217391 [2024-11-12 16:18:00,738 INFO L175 Difference]: Start difference. First operand has 75 places, 72 transitions, 164 flow. Second operand 3 states and 159 transitions. [2024-11-12 16:18:00,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 83 transitions, 284 flow [2024-11-12 16:18:00,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 83 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:18:00,749 INFO L231 Difference]: Finished difference. Result has 75 places, 73 transitions, 174 flow [2024-11-12 16:18:00,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=75, PETRI_TRANSITIONS=73} [2024-11-12 16:18:00,751 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -1 predicate places. [2024-11-12 16:18:00,751 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 73 transitions, 174 flow [2024-11-12 16:18:00,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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) [2024-11-12 16:18:00,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:18:00,752 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-12 16:18:00,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 16:18:00,752 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-12 16:18:00,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:18:00,753 INFO L85 PathProgramCache]: Analyzing trace with hash 780036881, now seen corresponding path program 1 times [2024-11-12 16:18:00,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:18:00,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343457437] [2024-11-12 16:18:00,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:18:00,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:18:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:18:00,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:18:00,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:18:00,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343457437] [2024-11-12 16:18:00,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343457437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:18:00,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:18:00,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:18:00,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152583106] [2024-11-12 16:18:00,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:18:00,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:18:00,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:18:00,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:18:00,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:18:00,890 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 92 [2024-11-12 16:18:00,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 73 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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) [2024-11-12 16:18:00,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:18:00,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 92 [2024-11-12 16:18:00,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:18:01,579 INFO L124 PetriNetUnfolderBase]: 2919/6072 cut-off events. [2024-11-12 16:18:01,579 INFO L125 PetriNetUnfolderBase]: For 387/387 co-relation queries the response was YES. [2024-11-12 16:18:01,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10964 conditions, 6072 events. 2919/6072 cut-off events. For 387/387 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 48401 event pairs, 1024 based on Foata normal form. 10/5861 useless extension candidates. Maximal degree in co-relation 1102. Up to 4245 conditions per place. [2024-11-12 16:18:01,622 INFO L140 encePairwiseOnDemand]: 88/92 looper letters, 65 selfloop transitions, 4 changer transitions 0/103 dead transitions. [2024-11-12 16:18:01,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 103 transitions, 374 flow [2024-11-12 16:18:01,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:18:01,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:18:01,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions. [2024-11-12 16:18:01,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5815217391304348 [2024-11-12 16:18:01,624 INFO L175 Difference]: Start difference. First operand has 75 places, 73 transitions, 174 flow. Second operand 4 states and 214 transitions. [2024-11-12 16:18:01,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 103 transitions, 374 flow [2024-11-12 16:18:01,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 103 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 16:18:01,629 INFO L231 Difference]: Finished difference. Result has 78 places, 74 transitions, 191 flow [2024-11-12 16:18:01,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=191, PETRI_PLACES=78, PETRI_TRANSITIONS=74} [2024-11-12 16:18:01,631 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 2 predicate places. [2024-11-12 16:18:01,632 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 191 flow [2024-11-12 16:18:01,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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) [2024-11-12 16:18:01,632 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:18:01,633 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-12 16:18:01,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 16:18:01,633 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-12 16:18:01,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:18:01,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1525045818, now seen corresponding path program 1 times [2024-11-12 16:18:01,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:18:01,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94375210] [2024-11-12 16:18:01,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:18:01,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:18:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:18:01,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:18:01,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:18:01,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94375210] [2024-11-12 16:18:01,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94375210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:18:01,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:18:01,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:18:01,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145273308] [2024-11-12 16:18:01,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:18:01,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:18:01,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:18:01,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:18:01,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:18:01,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 92 [2024-11-12 16:18:01,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 74 transitions, 191 flow. Second operand has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 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) [2024-11-12 16:18:01,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:18:01,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 92 [2024-11-12 16:18:01,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:18:02,361 INFO L124 PetriNetUnfolderBase]: 2931/5744 cut-off events. [2024-11-12 16:18:02,361 INFO L125 PetriNetUnfolderBase]: For 930/930 co-relation queries the response was YES. [2024-11-12 16:18:02,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10883 conditions, 5744 events. 2931/5744 cut-off events. For 930/930 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 42497 event pairs, 1851 based on Foata normal form. 100/5711 useless extension candidates. Maximal degree in co-relation 7015. Up to 3705 conditions per place. [2024-11-12 16:18:02,405 INFO L140 encePairwiseOnDemand]: 88/92 looper letters, 81 selfloop transitions, 5 changer transitions 0/120 dead transitions. [2024-11-12 16:18:02,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 120 transitions, 451 flow [2024-11-12 16:18:02,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:18:02,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 16:18:02,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 267 transitions. [2024-11-12 16:18:02,407 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5804347826086956 [2024-11-12 16:18:02,407 INFO L175 Difference]: Start difference. First operand has 78 places, 74 transitions, 191 flow. Second operand 5 states and 267 transitions. [2024-11-12 16:18:02,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 120 transitions, 451 flow [2024-11-12 16:18:02,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 120 transitions, 442 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-12 16:18:02,412 INFO L231 Difference]: Finished difference. Result has 79 places, 73 transitions, 186 flow [2024-11-12 16:18:02,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=79, PETRI_TRANSITIONS=73} [2024-11-12 16:18:02,413 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 3 predicate places. [2024-11-12 16:18:02,413 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 73 transitions, 186 flow [2024-11-12 16:18:02,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 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) [2024-11-12 16:18:02,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:18:02,414 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2024-11-12 16:18:02,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 16:18:02,414 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-12 16:18:02,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:18:02,415 INFO L85 PathProgramCache]: Analyzing trace with hash -31779642, now seen corresponding path program 1 times [2024-11-12 16:18:02,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:18:02,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116987861] [2024-11-12 16:18:02,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:18:02,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:18:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 16:18:02,433 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 16:18:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 16:18:02,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 16:18:02,449 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 16:18:02,449 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-12 16:18:02,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2024-11-12 16:18:02,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2024-11-12 16:18:02,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (3 of 7 remaining) [2024-11-12 16:18:02,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2024-11-12 16:18:02,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 7 remaining) [2024-11-12 16:18:02,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-12 16:18:02,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 16:18:02,453 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-12 16:18:02,458 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-12 16:18:02,458 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-12 16:18:02,486 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-12 16:18:02,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 117 transitions, 261 flow [2024-11-12 16:18:02,511 INFO L124 PetriNetUnfolderBase]: 54/276 cut-off events. [2024-11-12 16:18:02,512 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-12 16:18:02,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 276 events. 54/276 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1225 event pairs, 1 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 191. Up to 12 conditions per place. [2024-11-12 16:18:02,514 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 117 transitions, 261 flow [2024-11-12 16:18:02,517 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 117 transitions, 261 flow [2024-11-12 16:18:02,518 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 16:18:02,521 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;@30b8572a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 16:18:02,522 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-12 16:18:02,524 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 16:18:02,524 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-12 16:18:02,524 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 16:18:02,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:18:02,524 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-12 16:18:02,525 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-12 16:18:02,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:18:02,525 INFO L85 PathProgramCache]: Analyzing trace with hash 577423, now seen corresponding path program 1 times [2024-11-12 16:18:02,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:18:02,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31257653] [2024-11-12 16:18:02,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:18:02,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:18:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:18:02,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:18:02,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:18:02,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31257653] [2024-11-12 16:18:02,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31257653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:18:02,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:18:02,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 16:18:02,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040723827] [2024-11-12 16:18:02,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:18:02,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:18:02,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:18:02,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:18:02,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:18:02,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 117 [2024-11-12 16:18:02,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 117 transitions, 261 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:18:02,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:18:02,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 117 [2024-11-12 16:18:02,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:18:09,834 INFO L124 PetriNetUnfolderBase]: 53626/87325 cut-off events. [2024-11-12 16:18:09,834 INFO L125 PetriNetUnfolderBase]: For 1236/1236 co-relation queries the response was YES. [2024-11-12 16:18:10,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161738 conditions, 87325 events. 53626/87325 cut-off events. For 1236/1236 co-relation queries the response was YES. Maximal size of possible extension queue 2347. Compared 781289 event pairs, 43458 based on Foata normal form. 25258/109403 useless extension candidates. Maximal degree in co-relation 58750. Up to 63282 conditions per place. [2024-11-12 16:18:10,535 INFO L140 encePairwiseOnDemand]: 91/117 looper letters, 75 selfloop transitions, 2 changer transitions 1/119 dead transitions. [2024-11-12 16:18:10,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 119 transitions, 421 flow [2024-11-12 16:18:10,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:18:10,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:18:10,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2024-11-12 16:18:10,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2024-11-12 16:18:10,538 INFO L175 Difference]: Start difference. First operand has 96 places, 117 transitions, 261 flow. Second operand 3 states and 243 transitions. [2024-11-12 16:18:10,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 119 transitions, 421 flow [2024-11-12 16:18:10,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 119 transitions, 421 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 16:18:10,546 INFO L231 Difference]: Finished difference. Result has 95 places, 91 transitions, 213 flow [2024-11-12 16:18:10,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=213, PETRI_PLACES=95, PETRI_TRANSITIONS=91} [2024-11-12 16:18:10,549 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, -1 predicate places. [2024-11-12 16:18:10,550 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 91 transitions, 213 flow [2024-11-12 16:18:10,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:18:10,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:18:10,551 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-12 16:18:10,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 16:18:10,551 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-12 16:18:10,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:18:10,552 INFO L85 PathProgramCache]: Analyzing trace with hash 577424, now seen corresponding path program 1 times [2024-11-12 16:18:10,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:18:10,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977539190] [2024-11-12 16:18:10,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:18:10,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:18:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:18:10,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:18:10,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:18:10,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977539190] [2024-11-12 16:18:10,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977539190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:18:10,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:18:10,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 16:18:10,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119482539] [2024-11-12 16:18:10,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:18:10,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:18:10,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:18:10,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:18:10,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:18:10,636 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 117 [2024-11-12 16:18:10,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 91 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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) [2024-11-12 16:18:10,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:18:10,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 117 [2024-11-12 16:18:10,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:18:15,905 INFO L124 PetriNetUnfolderBase]: 46695/77911 cut-off events. [2024-11-12 16:18:15,905 INFO L125 PetriNetUnfolderBase]: For 4252/4252 co-relation queries the response was YES. [2024-11-12 16:18:16,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145198 conditions, 77911 events. 46695/77911 cut-off events. For 4252/4252 co-relation queries the response was YES. Maximal size of possible extension queue 2097. Compared 708376 event pairs, 27954 based on Foata normal form. 1/74614 useless extension candidates. Maximal degree in co-relation 130511. Up to 63779 conditions per place. [2024-11-12 16:18:16,457 INFO L140 encePairwiseOnDemand]: 113/117 looper letters, 58 selfloop transitions, 2 changer transitions 0/102 dead transitions. [2024-11-12 16:18:16,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 102 transitions, 355 flow [2024-11-12 16:18:16,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:18:16,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:18:16,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2024-11-12 16:18:16,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5527065527065527 [2024-11-12 16:18:16,459 INFO L175 Difference]: Start difference. First operand has 95 places, 91 transitions, 213 flow. Second operand 3 states and 194 transitions. [2024-11-12 16:18:16,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 102 transitions, 355 flow [2024-11-12 16:18:16,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 102 transitions, 351 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:18:16,693 INFO L231 Difference]: Finished difference. Result has 95 places, 92 transitions, 223 flow [2024-11-12 16:18:16,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=223, PETRI_PLACES=95, PETRI_TRANSITIONS=92} [2024-11-12 16:18:16,694 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, -1 predicate places. [2024-11-12 16:18:16,694 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 92 transitions, 223 flow [2024-11-12 16:18:16,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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) [2024-11-12 16:18:16,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:18:16,694 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-12 16:18:16,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 16:18:16,694 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-12 16:18:16,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:18:16,695 INFO L85 PathProgramCache]: Analyzing trace with hash 705734703, now seen corresponding path program 1 times [2024-11-12 16:18:16,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:18:16,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114743182] [2024-11-12 16:18:16,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:18:16,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:18:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:18:16,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:18:16,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:18:16,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114743182] [2024-11-12 16:18:16,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114743182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:18:16,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:18:16,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:18:16,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610291022] [2024-11-12 16:18:16,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:18:16,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:18:16,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:18:16,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:18:16,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:18:16,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 117 [2024-11-12 16:18:16,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 92 transitions, 223 flow. Second operand has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 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) [2024-11-12 16:18:16,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:18:16,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 117 [2024-11-12 16:18:16,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:18:22,362 INFO L124 PetriNetUnfolderBase]: 47136/76933 cut-off events. [2024-11-12 16:18:22,363 INFO L125 PetriNetUnfolderBase]: For 4178/4178 co-relation queries the response was YES. [2024-11-12 16:18:22,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144638 conditions, 76933 events. 47136/76933 cut-off events. For 4178/4178 co-relation queries the response was YES. Maximal size of possible extension queue 2079. Compared 677161 event pairs, 25585 based on Foata normal form. 1120/76226 useless extension candidates. Maximal degree in co-relation 130057. Up to 49353 conditions per place. [2024-11-12 16:18:23,205 INFO L140 encePairwiseOnDemand]: 112/117 looper letters, 111 selfloop transitions, 5 changer transitions 0/157 dead transitions. [2024-11-12 16:18:23,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 157 transitions, 583 flow [2024-11-12 16:18:23,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:18:23,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 16:18:23,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 333 transitions. [2024-11-12 16:18:23,207 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5692307692307692 [2024-11-12 16:18:23,207 INFO L175 Difference]: Start difference. First operand has 95 places, 92 transitions, 223 flow. Second operand 5 states and 333 transitions. [2024-11-12 16:18:23,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 157 transitions, 583 flow [2024-11-12 16:18:23,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 157 transitions, 581 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 16:18:23,214 INFO L231 Difference]: Finished difference. Result has 98 places, 92 transitions, 234 flow [2024-11-12 16:18:23,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=234, PETRI_PLACES=98, PETRI_TRANSITIONS=92} [2024-11-12 16:18:23,215 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 2 predicate places. [2024-11-12 16:18:23,215 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 92 transitions, 234 flow [2024-11-12 16:18:23,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 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) [2024-11-12 16:18:23,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:18:23,216 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1] [2024-11-12 16:18:23,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 16:18:23,216 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-12 16:18:23,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:18:23,217 INFO L85 PathProgramCache]: Analyzing trace with hash 868162318, now seen corresponding path program 1 times [2024-11-12 16:18:23,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:18:23,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076520339] [2024-11-12 16:18:23,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:18:23,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:18:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 16:18:23,237 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 16:18:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 16:18:23,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 16:18:23,254 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 16:18:23,254 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-12 16:18:23,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2024-11-12 16:18:23,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2024-11-12 16:18:23,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (3 of 7 remaining) [2024-11-12 16:18:23,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2024-11-12 16:18:23,258 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 7 remaining) [2024-11-12 16:18:23,258 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-12 16:18:23,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 16:18:23,258 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-12 16:18:23,260 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-12 16:18:23,260 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-12 16:18:23,292 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-12 16:18:23,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 142 transitions, 324 flow [2024-11-12 16:18:23,327 INFO L124 PetriNetUnfolderBase]: 80/416 cut-off events. [2024-11-12 16:18:23,328 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-12 16:18:23,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 416 events. 80/416 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2025 event pairs, 6 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 300. Up to 32 conditions per place. [2024-11-12 16:18:23,333 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 142 transitions, 324 flow [2024-11-12 16:18:23,336 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 142 transitions, 324 flow [2024-11-12 16:18:23,337 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 16:18:23,338 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;@30b8572a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 16:18:23,338 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-12 16:18:23,340 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 16:18:23,340 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-12 16:18:23,340 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 16:18:23,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:18:23,340 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-12 16:18:23,340 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-12 16:18:23,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:18:23,341 INFO L85 PathProgramCache]: Analyzing trace with hash 718429, now seen corresponding path program 1 times [2024-11-12 16:18:23,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:18:23,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203248668] [2024-11-12 16:18:23,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:18:23,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:18:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:18:23,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:18:23,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:18:23,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203248668] [2024-11-12 16:18:23,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203248668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:18:23,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:18:23,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 16:18:23,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144538608] [2024-11-12 16:18:23,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:18:23,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:18:23,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:18:23,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:18:23,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:18:23,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 142 [2024-11-12 16:18:23,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 142 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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) [2024-11-12 16:18:23,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:18:23,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 142 [2024-11-12 16:18:23,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand