./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 c7c6ca5d 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-?-c7c6ca5-m [2024-11-09 10:41:34,200 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:41:34,262 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:41:34,267 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:41:34,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:41:34,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:41:34,299 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:41:34,299 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:41:34,300 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:41:34,303 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:41:34,303 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:41:34,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:41:34,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:41:34,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:41:34,304 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:41:34,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:41:34,304 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:41:34,305 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:41:34,305 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:41:34,305 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:41:34,305 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:41:34,307 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:41:34,307 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:41:34,307 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:41:34,308 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:41:34,308 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:41:34,308 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:41:34,308 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:41:34,309 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:41:34,309 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:41:34,309 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:41:34,310 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:41:34,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:41:34,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:41:34,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:41:34,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:41:34,311 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:41:34,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:41:34,312 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:41:34,312 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:41:34,312 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:41:34,312 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:41:34,313 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-09 10:41:34,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:41:34,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:41:34,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:41:34,543 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:41:34,544 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:41:34,544 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-09 10:41:35,752 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:41:35,951 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:41:35,953 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_06-cond_racing1.i [2024-11-09 10:41:35,970 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aab50fb82/8af906d9e4dd41279c8260906260ce12/FLAG2ce8b48ea [2024-11-09 10:41:36,301 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aab50fb82/8af906d9e4dd41279c8260906260ce12 [2024-11-09 10:41:36,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:41:36,305 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:41:36,308 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:41:36,308 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:41:36,312 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:41:36,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:41:36" (1/1) ... [2024-11-09 10:41:36,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408f0289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:36, skipping insertion in model container [2024-11-09 10:41:36,313 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:41:36" (1/1) ... [2024-11-09 10:41:36,348 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:41:36,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:41:36,720 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:41:36,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:41:36,821 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:41:36,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:36 WrapperNode [2024-11-09 10:41:36,822 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:41:36,823 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:41:36,823 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:41:36,823 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:41:36,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:36" (1/1) ... [2024-11-09 10:41:36,850 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:36" (1/1) ... [2024-11-09 10:41:36,870 INFO L138 Inliner]: procedures = 271, calls = 42, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2024-11-09 10:41:36,871 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:41:36,871 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:41:36,871 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:41:36,871 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:41:36,879 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:36" (1/1) ... [2024-11-09 10:41:36,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:36" (1/1) ... [2024-11-09 10:41:36,882 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:36" (1/1) ... [2024-11-09 10:41:36,893 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-09 10:41:36,893 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:36" (1/1) ... [2024-11-09 10:41:36,893 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:36" (1/1) ... [2024-11-09 10:41:36,899 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:36" (1/1) ... [2024-11-09 10:41:36,902 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:36" (1/1) ... [2024-11-09 10:41:36,903 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:36" (1/1) ... [2024-11-09 10:41:36,904 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:36" (1/1) ... [2024-11-09 10:41:36,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:41:36,907 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:41:36,907 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:41:36,907 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:41:36,908 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:36" (1/1) ... [2024-11-09 10:41:36,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:41:36,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:41:36,933 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-09 10:41:36,935 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-09 10:41:36,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 10:41:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:41:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 10:41:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 10:41:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 10:41:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 10:41:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 10:41:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 10:41:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 10:41:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 10:41:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 10:41:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 10:41:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 10:41:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 10:41:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:41:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-09 10:41:36,971 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-09 10:41:36,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:41:36,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 10:41:36,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 10:41:36,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 10:41:36,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 10:41:36,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:41:36,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:41:36,972 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:41:37,084 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:41:37,086 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:41:37,266 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:41:37,266 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:41:37,392 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:41:37,392 INFO L316 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-09 10:41:37,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:41:37 BoogieIcfgContainer [2024-11-09 10:41:37,393 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:41:37,397 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:41:37,397 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:41:37,399 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:41:37,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:41:36" (1/3) ... [2024-11-09 10:41:37,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eae33d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:41:37, skipping insertion in model container [2024-11-09 10:41:37,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:36" (2/3) ... [2024-11-09 10:41:37,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eae33d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:41:37, skipping insertion in model container [2024-11-09 10:41:37,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:41:37" (3/3) ... [2024-11-09 10:41:37,405 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_06-cond_racing1.i [2024-11-09 10:41:37,422 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:41:37,432 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-09 10:41:37,433 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:41:37,462 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-09 10:41:37,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 67 transitions, 141 flow [2024-11-09 10:41:37,519 INFO L124 PetriNetUnfolderBase]: 21/105 cut-off events. [2024-11-09 10:41:37,520 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 10:41:37,523 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-09 10:41:37,523 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 67 transitions, 141 flow [2024-11-09 10:41:37,526 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 67 transitions, 141 flow [2024-11-09 10:41:37,532 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:41:37,537 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;@2072d929, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:41:37,537 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 10:41:37,539 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:41:37,539 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-09 10:41:37,540 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:41:37,540 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:37,540 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:41:37,540 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-09 10:41:37,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:37,544 INFO L85 PathProgramCache]: Analyzing trace with hash 369886, now seen corresponding path program 1 times [2024-11-09 10:41:37,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:37,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216671475] [2024-11-09 10:41:37,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:37,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:37,779 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-09 10:41:37,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:37,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216671475] [2024-11-09 10:41:37,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216671475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:41:37,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:41:37,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:41:37,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983802035] [2024-11-09 10:41:37,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:41:37,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:41:37,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:37,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:41:37,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:41:37,826 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 67 [2024-11-09 10:41:37,827 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-09 10:41:37,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:37,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 67 [2024-11-09 10:41:37,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:37,961 INFO L124 PetriNetUnfolderBase]: 179/511 cut-off events. [2024-11-09 10:41:37,962 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 10:41:37,963 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-09 10:41:37,968 INFO L140 encePairwiseOnDemand]: 53/67 looper letters, 35 selfloop transitions, 2 changer transitions 1/63 dead transitions. [2024-11-09 10:41:37,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 63 transitions, 209 flow [2024-11-09 10:41:37,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:41:37,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:41:37,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2024-11-09 10:41:37,978 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6517412935323383 [2024-11-09 10:41:37,980 INFO L175 Difference]: Start difference. First operand has 56 places, 67 transitions, 141 flow. Second operand 3 states and 131 transitions. [2024-11-09 10:41:37,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 63 transitions, 209 flow [2024-11-09 10:41:37,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 63 transitions, 209 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:41:37,986 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 117 flow [2024-11-09 10:41:37,988 INFO L260 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-09 10:41:37,991 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places. [2024-11-09 10:41:37,992 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 117 flow [2024-11-09 10:41:37,992 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-09 10:41:37,992 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:37,993 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:41:37,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:41:37,993 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-09 10:41:37,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:37,994 INFO L85 PathProgramCache]: Analyzing trace with hash 369887, now seen corresponding path program 1 times [2024-11-09 10:41:37,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:37,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844658626] [2024-11-09 10:41:37,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:37,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:38,126 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-09 10:41:38,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:38,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844658626] [2024-11-09 10:41:38,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844658626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:41:38,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:41:38,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:41:38,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369788436] [2024-11-09 10:41:38,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:41:38,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:41:38,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:38,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:41:38,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:41:38,144 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 67 [2024-11-09 10:41:38,144 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-09 10:41:38,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:38,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 67 [2024-11-09 10:41:38,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:38,254 INFO L124 PetriNetUnfolderBase]: 141/445 cut-off events. [2024-11-09 10:41:38,256 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-11-09 10:41:38,257 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-09 10:41:38,258 INFO L140 encePairwiseOnDemand]: 63/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2024-11-09 10:41:38,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 63 transitions, 211 flow [2024-11-09 10:41:38,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:41:38,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:41:38,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2024-11-09 10:41:38,262 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6119402985074627 [2024-11-09 10:41:38,262 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 117 flow. Second operand 3 states and 123 transitions. [2024-11-09 10:41:38,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 63 transitions, 211 flow [2024-11-09 10:41:38,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 63 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:41:38,266 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 123 flow [2024-11-09 10:41:38,266 INFO L260 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-09 10:41:38,266 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places. [2024-11-09 10:41:38,267 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 123 flow [2024-11-09 10:41:38,267 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-09 10:41:38,267 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:38,267 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-09 10:41:38,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:41:38,268 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-09 10:41:38,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:38,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1988286292, now seen corresponding path program 1 times [2024-11-09 10:41:38,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:38,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716843656] [2024-11-09 10:41:38,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:38,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:38,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:41:38,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:38,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716843656] [2024-11-09 10:41:38,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716843656] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:41:38,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622765947] [2024-11-09 10:41:38,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:38,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:41:38,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:41:38,396 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:41:38,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 10:41:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:38,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:41:38,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:41:38,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 10:41:38,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:41:38,560 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:41:38,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:41:38,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622765947] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:41:38,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:41:38,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2024-11-09 10:41:38,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563961113] [2024-11-09 10:41:38,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:41:38,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 10:41:38,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:38,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 10:41:38,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 10:41:38,650 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 67 [2024-11-09 10:41:38,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 123 flow. Second operand has 9 states, 9 states have (on average 29.333333333333332) internal successors, (264), 9 states have internal predecessors, (264), 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-09 10:41:38,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:38,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 67 [2024-11-09 10:41:38,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:38,717 INFO L124 PetriNetUnfolderBase]: 27/100 cut-off events. [2024-11-09 10:41:38,717 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-11-09 10:41:38,717 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-09 10:41:38,717 INFO L140 encePairwiseOnDemand]: 63/67 looper letters, 23 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2024-11-09 10:41:38,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 34 transitions, 128 flow [2024-11-09 10:41:38,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:41:38,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:41:38,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2024-11-09 10:41:38,720 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.503731343283582 [2024-11-09 10:41:38,720 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 123 flow. Second operand 4 states and 135 transitions. [2024-11-09 10:41:38,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 34 transitions, 128 flow [2024-11-09 10:41:38,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 34 transitions, 122 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:41:38,721 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 54 flow [2024-11-09 10:41:38,721 INFO L260 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-09 10:41:38,722 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -27 predicate places. [2024-11-09 10:41:38,722 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 54 flow [2024-11-09 10:41:38,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 29.333333333333332) internal successors, (264), 9 states have internal predecessors, (264), 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-09 10:41:38,722 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:38,723 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1] [2024-11-09 10:41:38,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 10:41:38,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:41:38,924 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-09 10:41:38,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:38,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1507332563, now seen corresponding path program 1 times [2024-11-09 10:41:38,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:38,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352727030] [2024-11-09 10:41:38,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:38,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:41:38,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:41:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:41:38,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:41:38,971 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:41:38,972 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-09 10:41:38,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2024-11-09 10:41:38,974 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2024-11-09 10:41:38,974 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (3 of 7 remaining) [2024-11-09 10:41:38,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2024-11-09 10:41:38,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 7 remaining) [2024-11-09 10:41:38,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-09 10:41:38,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:41:38,975 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 10:41:38,977 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 10:41:38,977 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-09 10:41:38,992 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 10:41:38,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 92 transitions, 200 flow [2024-11-09 10:41:39,006 INFO L124 PetriNetUnfolderBase]: 36/180 cut-off events. [2024-11-09 10:41:39,007 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-09 10:41:39,008 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-09 10:41:39,008 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 92 transitions, 200 flow [2024-11-09 10:41:39,009 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 92 transitions, 200 flow [2024-11-09 10:41:39,010 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:41:39,012 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;@2072d929, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:41:39,013 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 10:41:39,014 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:41:39,015 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-09 10:41:39,015 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:41:39,015 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:39,015 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:41:39,015 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-09 10:41:39,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:39,016 INFO L85 PathProgramCache]: Analyzing trace with hash 461242, now seen corresponding path program 1 times [2024-11-09 10:41:39,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:39,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273476769] [2024-11-09 10:41:39,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:39,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:39,043 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-09 10:41:39,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:39,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273476769] [2024-11-09 10:41:39,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273476769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:41:39,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:41:39,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:41:39,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646362806] [2024-11-09 10:41:39,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:41:39,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:41:39,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:39,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:41:39,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:41:39,059 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 92 [2024-11-09 10:41:39,059 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-09 10:41:39,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:39,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 92 [2024-11-09 10:41:39,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:39,621 INFO L124 PetriNetUnfolderBase]: 3559/6891 cut-off events. [2024-11-09 10:41:39,621 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-11-09 10:41:39,631 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-09 10:41:39,655 INFO L140 encePairwiseOnDemand]: 72/92 looper letters, 55 selfloop transitions, 2 changer transitions 1/91 dead transitions. [2024-11-09 10:41:39,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 91 transitions, 314 flow [2024-11-09 10:41:39,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:41:39,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:41:39,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2024-11-09 10:41:39,658 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.677536231884058 [2024-11-09 10:41:39,658 INFO L175 Difference]: Start difference. First operand has 76 places, 92 transitions, 200 flow. Second operand 3 states and 187 transitions. [2024-11-09 10:41:39,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 91 transitions, 314 flow [2024-11-09 10:41:39,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 91 transitions, 314 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:41:39,661 INFO L231 Difference]: Finished difference. Result has 75 places, 72 transitions, 164 flow [2024-11-09 10:41:39,661 INFO L260 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-09 10:41:39,661 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, -1 predicate places. [2024-11-09 10:41:39,662 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 72 transitions, 164 flow [2024-11-09 10:41:39,662 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-09 10:41:39,662 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:39,662 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:41:39,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:41:39,662 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-09 10:41:39,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:39,663 INFO L85 PathProgramCache]: Analyzing trace with hash 461243, now seen corresponding path program 1 times [2024-11-09 10:41:39,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:39,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572550453] [2024-11-09 10:41:39,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:39,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:39,768 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-09 10:41:39,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:39,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572550453] [2024-11-09 10:41:39,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572550453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:41:39,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:41:39,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:41:39,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273720134] [2024-11-09 10:41:39,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:41:39,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:41:39,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:39,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:41:39,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:41:39,779 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 92 [2024-11-09 10:41:39,779 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-09 10:41:39,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:39,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 92 [2024-11-09 10:41:39,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:40,159 INFO L124 PetriNetUnfolderBase]: 2998/6181 cut-off events. [2024-11-09 10:41:40,159 INFO L125 PetriNetUnfolderBase]: For 318/318 co-relation queries the response was YES. [2024-11-09 10:41:40,168 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-09 10:41:40,187 INFO L140 encePairwiseOnDemand]: 88/92 looper letters, 47 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2024-11-09 10:41:40,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 83 transitions, 284 flow [2024-11-09 10:41:40,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:41:40,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:41:40,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2024-11-09 10:41:40,189 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5760869565217391 [2024-11-09 10:41:40,189 INFO L175 Difference]: Start difference. First operand has 75 places, 72 transitions, 164 flow. Second operand 3 states and 159 transitions. [2024-11-09 10:41:40,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 83 transitions, 284 flow [2024-11-09 10:41:40,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 83 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:41:40,193 INFO L231 Difference]: Finished difference. Result has 75 places, 73 transitions, 174 flow [2024-11-09 10:41:40,194 INFO L260 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-09 10:41:40,194 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, -1 predicate places. [2024-11-09 10:41:40,194 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 73 transitions, 174 flow [2024-11-09 10:41:40,194 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-09 10:41:40,195 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:40,195 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-09 10:41:40,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:41:40,195 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-09 10:41:40,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:40,195 INFO L85 PathProgramCache]: Analyzing trace with hash 780036881, now seen corresponding path program 1 times [2024-11-09 10:41:40,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:40,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185116639] [2024-11-09 10:41:40,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:40,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:40,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:41:40,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:40,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185116639] [2024-11-09 10:41:40,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185116639] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:41:40,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036486489] [2024-11-09 10:41:40,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:40,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:41:40,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:41:40,278 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:41:40,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 10:41:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:40,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:41:40,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:41:40,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 10:41:40,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:41:40,405 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:41:40,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:41:40,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036486489] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:41:40,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:41:40,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2024-11-09 10:41:40,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111587456] [2024-11-09 10:41:40,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:41:40,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 10:41:40,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:40,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 10:41:40,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 10:41:40,500 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 92 [2024-11-09 10:41:40,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 73 transitions, 174 flow. Second operand has 9 states, 9 states have (on average 37.333333333333336) internal successors, (336), 9 states have internal predecessors, (336), 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-09 10:41:40,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:40,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 92 [2024-11-09 10:41:40,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:40,687 INFO L124 PetriNetUnfolderBase]: 657/1295 cut-off events. [2024-11-09 10:41:40,687 INFO L125 PetriNetUnfolderBase]: For 245/245 co-relation queries the response was YES. [2024-11-09 10:41:40,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2554 conditions, 1295 events. 657/1295 cut-off events. For 245/245 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 7534 event pairs, 96 based on Foata normal form. 220/1456 useless extension candidates. Maximal degree in co-relation 2218. Up to 840 conditions per place. [2024-11-09 10:41:40,694 INFO L140 encePairwiseOnDemand]: 88/92 looper letters, 53 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2024-11-09 10:41:40,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 73 transitions, 276 flow [2024-11-09 10:41:40,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:41:40,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:41:40,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 235 transitions. [2024-11-09 10:41:40,696 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5108695652173914 [2024-11-09 10:41:40,696 INFO L175 Difference]: Start difference. First operand has 75 places, 73 transitions, 174 flow. Second operand 5 states and 235 transitions. [2024-11-09 10:41:40,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 73 transitions, 276 flow [2024-11-09 10:41:40,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 73 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:41:40,698 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 106 flow [2024-11-09 10:41:40,698 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=106, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2024-11-09 10:41:40,698 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, -24 predicate places. [2024-11-09 10:41:40,699 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 106 flow [2024-11-09 10:41:40,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 37.333333333333336) internal successors, (336), 9 states have internal predecessors, (336), 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-09 10:41:40,699 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:40,699 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2024-11-09 10:41:40,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 10:41:40,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-09 10:41:40,904 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-09 10:41:40,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:40,905 INFO L85 PathProgramCache]: Analyzing trace with hash -31779642, now seen corresponding path program 1 times [2024-11-09 10:41:40,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:40,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669153078] [2024-11-09 10:41:40,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:40,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:41:40,917 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:41:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:41:40,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:41:40,936 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:41:40,937 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-09 10:41:40,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2024-11-09 10:41:40,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2024-11-09 10:41:40,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (3 of 7 remaining) [2024-11-09 10:41:40,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2024-11-09 10:41:40,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 7 remaining) [2024-11-09 10:41:40,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-09 10:41:40,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:41:40,938 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 10:41:40,939 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 10:41:40,939 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-09 10:41:40,955 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-09 10:41:40,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 117 transitions, 261 flow [2024-11-09 10:41:40,985 INFO L124 PetriNetUnfolderBase]: 54/276 cut-off events. [2024-11-09 10:41:40,985 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-09 10:41:40,986 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-09 10:41:40,986 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 117 transitions, 261 flow [2024-11-09 10:41:40,988 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 117 transitions, 261 flow [2024-11-09 10:41:40,990 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:41:40,991 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;@2072d929, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:41:40,991 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 10:41:40,992 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:41:40,993 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-09 10:41:40,993 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:41:40,993 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:40,993 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:41:40,993 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-09 10:41:40,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:40,993 INFO L85 PathProgramCache]: Analyzing trace with hash 577423, now seen corresponding path program 1 times [2024-11-09 10:41:40,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:40,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167308454] [2024-11-09 10:41:40,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:40,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:41,014 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-09 10:41:41,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:41,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167308454] [2024-11-09 10:41:41,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167308454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:41:41,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:41:41,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:41:41,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21838948] [2024-11-09 10:41:41,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:41:41,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:41:41,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:41,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:41:41,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:41:41,023 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 117 [2024-11-09 10:41:41,023 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-09 10:41:41,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:41,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 117 [2024-11-09 10:41:41,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:46,509 INFO L124 PetriNetUnfolderBase]: 53626/87325 cut-off events. [2024-11-09 10:41:46,509 INFO L125 PetriNetUnfolderBase]: For 1236/1236 co-relation queries the response was YES. [2024-11-09 10:41:46,657 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-09 10:41:47,015 INFO L140 encePairwiseOnDemand]: 91/117 looper letters, 75 selfloop transitions, 2 changer transitions 1/119 dead transitions. [2024-11-09 10:41:47,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 119 transitions, 421 flow [2024-11-09 10:41:47,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:41:47,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:41:47,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2024-11-09 10:41:47,017 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2024-11-09 10:41:47,017 INFO L175 Difference]: Start difference. First operand has 96 places, 117 transitions, 261 flow. Second operand 3 states and 243 transitions. [2024-11-09 10:41:47,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 119 transitions, 421 flow [2024-11-09 10:41:47,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 119 transitions, 421 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:41:47,025 INFO L231 Difference]: Finished difference. Result has 95 places, 91 transitions, 213 flow [2024-11-09 10:41:47,025 INFO L260 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-09 10:41:47,026 INFO L277 CegarLoopForPetriNet]: 96 programPoint places, -1 predicate places. [2024-11-09 10:41:47,026 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 91 transitions, 213 flow [2024-11-09 10:41:47,026 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-09 10:41:47,026 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:47,026 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:41:47,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:41:47,026 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-09 10:41:47,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:47,027 INFO L85 PathProgramCache]: Analyzing trace with hash 577424, now seen corresponding path program 1 times [2024-11-09 10:41:47,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:47,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744139131] [2024-11-09 10:41:47,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:47,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:47,084 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-09 10:41:47,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:47,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744139131] [2024-11-09 10:41:47,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744139131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:41:47,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:41:47,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:41:47,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312436937] [2024-11-09 10:41:47,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:41:47,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:41:47,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:47,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:41:47,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:41:47,094 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 117 [2024-11-09 10:41:47,095 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-09 10:41:47,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:47,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 117 [2024-11-09 10:41:47,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:51,581 INFO L124 PetriNetUnfolderBase]: 46695/77911 cut-off events. [2024-11-09 10:41:51,581 INFO L125 PetriNetUnfolderBase]: For 4252/4252 co-relation queries the response was YES. [2024-11-09 10:41:51,705 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-09 10:41:52,154 INFO L140 encePairwiseOnDemand]: 113/117 looper letters, 58 selfloop transitions, 2 changer transitions 0/102 dead transitions. [2024-11-09 10:41:52,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 102 transitions, 355 flow [2024-11-09 10:41:52,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:41:52,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:41:52,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2024-11-09 10:41:52,155 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5527065527065527 [2024-11-09 10:41:52,156 INFO L175 Difference]: Start difference. First operand has 95 places, 91 transitions, 213 flow. Second operand 3 states and 194 transitions. [2024-11-09 10:41:52,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 102 transitions, 355 flow [2024-11-09 10:41:52,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 102 transitions, 351 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:41:52,363 INFO L231 Difference]: Finished difference. Result has 95 places, 92 transitions, 223 flow [2024-11-09 10:41:52,363 INFO L260 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-09 10:41:52,364 INFO L277 CegarLoopForPetriNet]: 96 programPoint places, -1 predicate places. [2024-11-09 10:41:52,364 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 92 transitions, 223 flow [2024-11-09 10:41:52,364 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-09 10:41:52,364 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:52,364 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-09 10:41:52,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 10:41:52,365 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-09 10:41:52,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:52,365 INFO L85 PathProgramCache]: Analyzing trace with hash 705734703, now seen corresponding path program 1 times [2024-11-09 10:41:52,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:52,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767110335] [2024-11-09 10:41:52,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:52,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:52,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:41:52,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:52,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767110335] [2024-11-09 10:41:52,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767110335] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:41:52,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291566436] [2024-11-09 10:41:52,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:52,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:41:52,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:41:52,437 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:41:52,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 10:41:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:52,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:41:52,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:41:52,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 10:41:52,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:41:52,555 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:41:52,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:41:52,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291566436] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:41:52,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:41:52,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2024-11-09 10:41:52,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708535041] [2024-11-09 10:41:52,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:41:52,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:41:52,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:52,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:41:52,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:41:52,624 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 117 [2024-11-09 10:41:52,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 92 transitions, 223 flow. Second operand has 7 states, 7 states have (on average 45.42857142857143) internal successors, (318), 7 states have internal predecessors, (318), 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-09 10:41:52,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:52,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 117 [2024-11-09 10:41:52,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:57,242 INFO L124 PetriNetUnfolderBase]: 47136/77422 cut-off events. [2024-11-09 10:41:57,243 INFO L125 PetriNetUnfolderBase]: For 4988/4988 co-relation queries the response was YES. [2024-11-09 10:41:57,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145127 conditions, 77422 events. 47136/77422 cut-off events. For 4988/4988 co-relation queries the response was YES. Maximal size of possible extension queue 2128. Compared 687736 event pairs, 19849 based on Foata normal form. 1120/77113 useless extension candidates. Maximal degree in co-relation 14547. Up to 49353 conditions per place. [2024-11-09 10:41:57,824 INFO L140 encePairwiseOnDemand]: 113/117 looper letters, 133 selfloop transitions, 6 changer transitions 0/180 dead transitions. [2024-11-09 10:41:57,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 180 transitions, 679 flow [2024-11-09 10:41:57,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:41:57,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:41:57,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 401 transitions. [2024-11-09 10:41:57,828 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5712250712250713 [2024-11-09 10:41:57,829 INFO L175 Difference]: Start difference. First operand has 95 places, 92 transitions, 223 flow. Second operand 6 states and 401 transitions. [2024-11-09 10:41:57,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 180 transitions, 679 flow [2024-11-09 10:41:57,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 180 transitions, 677 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:41:57,834 INFO L231 Difference]: Finished difference. Result has 98 places, 93 transitions, 237 flow [2024-11-09 10:41:57,834 INFO L260 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=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=98, PETRI_TRANSITIONS=93} [2024-11-09 10:41:57,835 INFO L277 CegarLoopForPetriNet]: 96 programPoint places, 2 predicate places. [2024-11-09 10:41:57,835 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 93 transitions, 237 flow [2024-11-09 10:41:57,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 45.42857142857143) internal successors, (318), 7 states have internal predecessors, (318), 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-09 10:41:57,835 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:57,835 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1] [2024-11-09 10:41:57,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 10:41:58,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:41:58,040 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-09 10:41:58,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:58,041 INFO L85 PathProgramCache]: Analyzing trace with hash 868162318, now seen corresponding path program 1 times [2024-11-09 10:41:58,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:58,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521706193] [2024-11-09 10:41:58,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:58,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:41:58,062 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:41:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:41:58,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:41:58,079 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:41:58,079 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-09 10:41:58,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2024-11-09 10:41:58,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2024-11-09 10:41:58,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (3 of 7 remaining) [2024-11-09 10:41:58,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2024-11-09 10:41:58,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 7 remaining) [2024-11-09 10:41:58,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-09 10:41:58,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 10:41:58,080 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 10:41:58,081 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 10:41:58,081 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-09 10:41:58,101 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-09 10:41:58,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 142 transitions, 324 flow [2024-11-09 10:41:58,124 INFO L124 PetriNetUnfolderBase]: 80/416 cut-off events. [2024-11-09 10:41:58,125 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-09 10:41:58,127 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-09 10:41:58,127 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 142 transitions, 324 flow [2024-11-09 10:41:58,129 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 142 transitions, 324 flow [2024-11-09 10:41:58,130 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:41:58,131 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;@2072d929, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:41:58,131 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 10:41:58,132 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:41:58,132 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-09 10:41:58,132 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:41:58,132 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:58,132 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:41:58,132 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-09 10:41:58,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:58,132 INFO L85 PathProgramCache]: Analyzing trace with hash 718429, now seen corresponding path program 1 times [2024-11-09 10:41:58,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:58,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923287915] [2024-11-09 10:41:58,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:58,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:58,162 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-09 10:41:58,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:58,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923287915] [2024-11-09 10:41:58,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923287915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:41:58,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:41:58,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:41:58,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244402335] [2024-11-09 10:41:58,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:41:58,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:41:58,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:58,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:41:58,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:41:58,175 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 142 [2024-11-09 10:41:58,175 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-09 10:41:58,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:58,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 142 [2024-11-09 10:41:58,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand