./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.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 eddb66a74cd149f880832378d52d5c02c94fd6efcf2d83aeade11bcdaaabe426 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 16:17:47,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 16:17:47,623 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 16:17:47,635 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 16:17:47,636 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 16:17:47,657 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 16:17:47,658 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 16:17:47,658 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 16:17:47,659 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 16:17:47,659 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 16:17:47,659 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 16:17:47,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 16:17:47,660 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 16:17:47,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 16:17:47,661 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 16:17:47,661 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 16:17:47,662 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 16:17:47,662 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 16:17:47,662 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 16:17:47,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 16:17:47,663 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 16:17:47,667 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 16:17:47,667 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 16:17:47,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 16:17:47,667 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 16:17:47,667 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 16:17:47,668 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 16:17:47,668 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 16:17:47,668 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 16:17:47,668 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 16:17:47,668 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 16:17:47,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 16:17:47,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 16:17:47,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:17:47,669 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 16:17:47,669 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 16:17:47,670 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 16:17:47,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 16:17:47,670 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 16:17:47,671 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 16:17:47,671 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 16:17:47,672 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 16:17:47,672 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 -> eddb66a74cd149f880832378d52d5c02c94fd6efcf2d83aeade11bcdaaabe426 [2024-11-12 16:17:47,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 16:17:47,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 16:17:47,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 16:17:47,968 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 16:17:47,968 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 16:17:47,969 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i [2024-11-12 16:17:49,407 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 16:17:49,648 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 16:17:49,649 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i [2024-11-12 16:17:49,670 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/010fe986b/86d53707af134e4295b0059e16260d28/FLAGd3c168e45 [2024-11-12 16:17:49,995 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/010fe986b/86d53707af134e4295b0059e16260d28 [2024-11-12 16:17:49,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 16:17:49,999 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 16:17:50,001 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 16:17:50,001 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 16:17:50,007 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 16:17:50,007 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:17:49" (1/1) ... [2024-11-12 16:17:50,008 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50d44a11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:17:50, skipping insertion in model container [2024-11-12 16:17:50,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:17:49" (1/1) ... [2024-11-12 16:17:50,058 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 16:17:50,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:17:50,436 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 16:17:50,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:17:50,536 INFO L204 MainTranslator]: Completed translation [2024-11-12 16:17:50,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:17:50 WrapperNode [2024-11-12 16:17:50,537 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 16:17:50,538 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 16:17:50,538 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 16:17:50,539 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 16:17:50,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:17:50" (1/1) ... [2024-11-12 16:17:50,561 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:17:50" (1/1) ... [2024-11-12 16:17:50,588 INFO L138 Inliner]: procedures = 171, calls = 42, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 85 [2024-11-12 16:17:50,590 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 16:17:50,591 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 16:17:50,592 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 16:17:50,592 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 16:17:50,602 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:17:50" (1/1) ... [2024-11-12 16:17:50,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:17:50" (1/1) ... [2024-11-12 16:17:50,605 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:17:50" (1/1) ... [2024-11-12 16:17:50,621 INFO L175 MemorySlicer]: Split 19 memory accesses to 5 slices as follows [2, 5, 5, 5, 2]. 26 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 0, 1]. [2024-11-12 16:17:50,622 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:17:50" (1/1) ... [2024-11-12 16:17:50,622 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:17:50" (1/1) ... [2024-11-12 16:17:50,630 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:17:50" (1/1) ... [2024-11-12 16:17:50,634 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:17:50" (1/1) ... [2024-11-12 16:17:50,636 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:17:50" (1/1) ... [2024-11-12 16:17:50,638 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:17:50" (1/1) ... [2024-11-12 16:17:50,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 16:17:50,643 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 16:17:50,643 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 16:17:50,643 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 16:17:50,644 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:17:50" (1/1) ... [2024-11-12 16:17:50,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:17:50,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:17:50,682 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 16:17:50,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 16:17:50,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 16:17:50,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 16:17:50,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 16:17:50,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-12 16:17:50,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-12 16:17:50,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 16:17:50,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 16:17:50,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 16:17:50,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-12 16:17:50,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-12 16:17:50,739 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-12 16:17:50,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 16:17:50,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 16:17:50,741 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-12 16:17:50,741 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-12 16:17:50,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 16:17:50,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 16:17:50,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 16:17:50,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 16:17:50,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-12 16:17:50,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-12 16:17:50,742 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-12 16:17:50,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 16:17:50,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 16:17:50,744 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 16:17:50,911 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 16:17:50,913 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 16:17:51,213 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 16:17:51,214 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 16:17:51,408 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 16:17:51,409 INFO L316 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-12 16:17:51,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:17:51 BoogieIcfgContainer [2024-11-12 16:17:51,409 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 16:17:51,413 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 16:17:51,413 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 16:17:51,416 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 16:17:51,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:17:49" (1/3) ... [2024-11-12 16:17:51,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3811e414 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:17:51, skipping insertion in model container [2024-11-12 16:17:51,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:17:50" (2/3) ... [2024-11-12 16:17:51,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3811e414 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:17:51, skipping insertion in model container [2024-11-12 16:17:51,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:17:51" (3/3) ... [2024-11-12 16:17:51,420 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_01-simple_racing.i [2024-11-12 16:17:51,437 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 16:17:51,438 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-12 16:17:51,438 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 16:17:51,478 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-12 16:17:51,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 60 transitions, 127 flow [2024-11-12 16:17:51,566 INFO L124 PetriNetUnfolderBase]: 15/91 cut-off events. [2024-11-12 16:17:51,567 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-12 16:17:51,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 91 events. 15/91 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 345 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 55. Up to 4 conditions per place. [2024-11-12 16:17:51,571 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 60 transitions, 127 flow [2024-11-12 16:17:51,575 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 60 transitions, 127 flow [2024-11-12 16:17:51,583 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 16:17:51,589 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;@2929c97b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 16:17:51,590 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-12 16:17:51,595 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 16:17:51,595 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-12 16:17:51,595 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 16:17:51,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:17:51,596 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-12 16:17:51,597 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-12 16:17:51,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:17:51,603 INFO L85 PathProgramCache]: Analyzing trace with hash 349125, now seen corresponding path program 1 times [2024-11-12 16:17:51,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:17:51,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052117130] [2024-11-12 16:17:51,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:17:51,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:17:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:17:51,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:17:51,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:17:51,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052117130] [2024-11-12 16:17:51,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052117130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:17:51,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:17:51,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 16:17:51,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132558280] [2024-11-12 16:17:51,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:17:51,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:17:51,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:17:51,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:17:51,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:17:51,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 60 [2024-11-12 16:17:51,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 60 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:17:51,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:17:51,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 60 [2024-11-12 16:17:51,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:17:52,152 INFO L124 PetriNetUnfolderBase]: 136/437 cut-off events. [2024-11-12 16:17:52,153 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-12 16:17:52,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 755 conditions, 437 events. 136/437 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2199 event pairs, 117 based on Foata normal form. 94/512 useless extension candidates. Maximal degree in co-relation 700. Up to 272 conditions per place. [2024-11-12 16:17:52,160 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 34 selfloop transitions, 2 changer transitions 1/56 dead transitions. [2024-11-12 16:17:52,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 56 transitions, 193 flow [2024-11-12 16:17:52,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:17:52,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:17:52,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2024-11-12 16:17:52,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6222222222222222 [2024-11-12 16:17:52,174 INFO L175 Difference]: Start difference. First operand has 52 places, 60 transitions, 127 flow. Second operand 3 states and 112 transitions. [2024-11-12 16:17:52,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 56 transitions, 193 flow [2024-11-12 16:17:52,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 56 transitions, 193 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 16:17:52,182 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 103 flow [2024-11-12 16:17:52,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2024-11-12 16:17:52,192 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2024-11-12 16:17:52,192 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 103 flow [2024-11-12 16:17:52,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:17:52,193 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:17:52,193 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-12 16:17:52,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 16:17:52,194 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-12 16:17:52,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:17:52,194 INFO L85 PathProgramCache]: Analyzing trace with hash 349126, now seen corresponding path program 1 times [2024-11-12 16:17:52,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:17:52,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784048486] [2024-11-12 16:17:52,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:17:52,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:17:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:17:52,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:17:52,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:17:52,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784048486] [2024-11-12 16:17:52,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784048486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:17:52,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:17:52,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 16:17:52,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806156764] [2024-11-12 16:17:52,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:17:52,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:17:52,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:17:52,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:17:52,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:17:52,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2024-11-12 16:17:52,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:17:52,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:17:52,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2024-11-12 16:17:52,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:17:52,574 INFO L124 PetriNetUnfolderBase]: 117/395 cut-off events. [2024-11-12 16:17:52,575 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-12 16:17:52,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 676 conditions, 395 events. 117/395 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2113 event pairs, 0 based on Foata normal form. 1/367 useless extension candidates. Maximal degree in co-relation 640. Up to 251 conditions per place. [2024-11-12 16:17:52,581 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 34 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2024-11-12 16:17:52,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 56 transitions, 195 flow [2024-11-12 16:17:52,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:17:52,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:17:52,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-11-12 16:17:52,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2024-11-12 16:17:52,585 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 103 flow. Second operand 3 states and 104 transitions. [2024-11-12 16:17:52,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 56 transitions, 195 flow [2024-11-12 16:17:52,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 56 transitions, 191 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:17:52,588 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 109 flow [2024-11-12 16:17:52,588 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2024-11-12 16:17:52,589 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2024-11-12 16:17:52,590 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 109 flow [2024-11-12 16:17:52,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:17:52,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:17:52,591 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-12 16:17:52,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 16:17:52,592 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-12 16:17:52,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:17:52,593 INFO L85 PathProgramCache]: Analyzing trace with hash 312064490, now seen corresponding path program 1 times [2024-11-12 16:17:52,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:17:52,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462838375] [2024-11-12 16:17:52,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:17:52,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:17:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:17:52,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:17:52,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:17:52,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462838375] [2024-11-12 16:17:52,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462838375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:17:52,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:17:52,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:17:52,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342347797] [2024-11-12 16:17:52,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:17:52,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:17:52,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:17:52,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:17:52,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:17:52,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2024-11-12 16:17:52,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:17:52,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:17:52,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2024-11-12 16:17:52,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:17:52,854 INFO L124 PetriNetUnfolderBase]: 27/100 cut-off events. [2024-11-12 16:17:52,854 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-11-12 16:17:52,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 100 events. 27/100 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 225 event pairs, 18 based on Foata normal form. 20/119 useless extension candidates. Maximal degree in co-relation 179. Up to 57 conditions per place. [2024-11-12 16:17:52,858 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 23 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2024-11-12 16:17:52,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 34 transitions, 128 flow [2024-11-12 16:17:52,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:17:52,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:17:52,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2024-11-12 16:17:52,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4625 [2024-11-12 16:17:52,860 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 109 flow. Second operand 4 states and 111 transitions. [2024-11-12 16:17:52,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 34 transitions, 128 flow [2024-11-12 16:17:52,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 34 transitions, 122 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-12 16:17:52,862 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 54 flow [2024-11-12 16:17:52,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=54, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2024-11-12 16:17:52,863 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -23 predicate places. [2024-11-12 16:17:52,864 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 54 flow [2024-11-12 16:17:52,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:17:52,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:17:52,865 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1] [2024-11-12 16:17:52,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 16:17:52,865 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-12 16:17:52,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:17:52,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1084064903, now seen corresponding path program 1 times [2024-11-12 16:17:52,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:17:52,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585312695] [2024-11-12 16:17:52,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:17:52,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:17:52,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 16:17:52,892 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 16:17:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 16:17:52,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 16:17:52,928 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 16:17:52,929 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-12 16:17:52,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2024-11-12 16:17:52,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2024-11-12 16:17:52,934 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2024-11-12 16:17:52,934 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2024-11-12 16:17:52,934 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2024-11-12 16:17:52,935 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-12 16:17:52,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 16:17:52,936 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-12 16:17:52,938 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-12 16:17:52,939 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-12 16:17:52,959 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-12 16:17:52,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 85 transitions, 186 flow [2024-11-12 16:17:52,979 INFO L124 PetriNetUnfolderBase]: 27/159 cut-off events. [2024-11-12 16:17:52,979 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-12 16:17:52,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 159 events. 27/159 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 679 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 95. Up to 6 conditions per place. [2024-11-12 16:17:52,982 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 85 transitions, 186 flow [2024-11-12 16:17:52,983 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 85 transitions, 186 flow [2024-11-12 16:17:52,984 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 16:17:52,985 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;@2929c97b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 16:17:52,985 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-12 16:17:52,987 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 16:17:52,987 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-12 16:17:52,987 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 16:17:52,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:17:52,987 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-12 16:17:52,989 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-12 16:17:52,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:17:52,989 INFO L85 PathProgramCache]: Analyzing trace with hash 433530, now seen corresponding path program 1 times [2024-11-12 16:17:52,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:17:52,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940120556] [2024-11-12 16:17:52,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:17:52,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:17:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:17:53,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:17:53,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:17:53,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940120556] [2024-11-12 16:17:53,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940120556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:17:53,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:17:53,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 16:17:53,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846145697] [2024-11-12 16:17:53,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:17:53,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:17:53,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:17:53,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:17:53,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:17:53,084 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 85 [2024-11-12 16:17:53,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 85 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:17:53,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:17:53,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 85 [2024-11-12 16:17:53,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:17:53,787 INFO L124 PetriNetUnfolderBase]: 2991/6066 cut-off events. [2024-11-12 16:17:53,788 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-11-12 16:17:53,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10951 conditions, 6066 events. 2991/6066 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 45949 event pairs, 2583 based on Foata normal form. 1632/7435 useless extension candidates. Maximal degree in co-relation 8032. Up to 4189 conditions per place. [2024-11-12 16:17:53,824 INFO L140 encePairwiseOnDemand]: 65/85 looper letters, 54 selfloop transitions, 2 changer transitions 1/84 dead transitions. [2024-11-12 16:17:53,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 84 transitions, 298 flow [2024-11-12 16:17:53,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:17:53,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:17:53,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2024-11-12 16:17:53,826 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6588235294117647 [2024-11-12 16:17:53,828 INFO L175 Difference]: Start difference. First operand has 72 places, 85 transitions, 186 flow. Second operand 3 states and 168 transitions. [2024-11-12 16:17:53,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 84 transitions, 298 flow [2024-11-12 16:17:53,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 84 transitions, 298 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 16:17:53,831 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 150 flow [2024-11-12 16:17:53,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2024-11-12 16:17:53,832 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -1 predicate places. [2024-11-12 16:17:53,832 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 150 flow [2024-11-12 16:17:53,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:17:53,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:17:53,833 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-12 16:17:53,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 16:17:53,834 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-12 16:17:53,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:17:53,834 INFO L85 PathProgramCache]: Analyzing trace with hash 433531, now seen corresponding path program 1 times [2024-11-12 16:17:53,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:17:53,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206796869] [2024-11-12 16:17:53,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:17:53,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:17:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:17:53,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:17:53,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:17:53,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206796869] [2024-11-12 16:17:53,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206796869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:17:53,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:17:53,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 16:17:53,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77166595] [2024-11-12 16:17:53,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:17:53,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:17:53,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:17:53,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:17:53,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:17:53,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 85 [2024-11-12 16:17:53,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:17:53,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:17:53,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 85 [2024-11-12 16:17:53,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:17:54,499 INFO L124 PetriNetUnfolderBase]: 2594/5471 cut-off events. [2024-11-12 16:17:54,500 INFO L125 PetriNetUnfolderBase]: For 135/143 co-relation queries the response was YES. [2024-11-12 16:17:54,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9831 conditions, 5471 events. 2594/5471 cut-off events. For 135/143 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 41717 event pairs, 2574 based on Foata normal form. 1/5163 useless extension candidates. Maximal degree in co-relation 9025. Up to 4168 conditions per place. [2024-11-12 16:17:54,534 INFO L140 encePairwiseOnDemand]: 81/85 looper letters, 46 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2024-11-12 16:17:54,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 76 transitions, 268 flow [2024-11-12 16:17:54,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:17:54,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:17:54,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2024-11-12 16:17:54,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5490196078431373 [2024-11-12 16:17:54,538 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 150 flow. Second operand 3 states and 140 transitions. [2024-11-12 16:17:54,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 76 transitions, 268 flow [2024-11-12 16:17:54,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 76 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:17:54,547 INFO L231 Difference]: Finished difference. Result has 71 places, 66 transitions, 160 flow [2024-11-12 16:17:54,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=71, PETRI_TRANSITIONS=66} [2024-11-12 16:17:54,548 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -1 predicate places. [2024-11-12 16:17:54,549 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 66 transitions, 160 flow [2024-11-12 16:17:54,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:17:54,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:17:54,549 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-12 16:17:54,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 16:17:54,550 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-12 16:17:54,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:17:54,551 INFO L85 PathProgramCache]: Analyzing trace with hash 955745000, now seen corresponding path program 1 times [2024-11-12 16:17:54,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:17:54,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222211301] [2024-11-12 16:17:54,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:17:54,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:17:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:17:54,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:17:54,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:17:54,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222211301] [2024-11-12 16:17:54,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222211301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:17:54,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:17:54,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:17:54,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519343951] [2024-11-12 16:17:54,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:17:54,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:17:54,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:17:54,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:17:54,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:17:54,677 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 85 [2024-11-12 16:17:54,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 66 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:17:54,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:17:54,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 85 [2024-11-12 16:17:54,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:17:55,273 INFO L124 PetriNetUnfolderBase]: 2585/5598 cut-off events. [2024-11-12 16:17:55,274 INFO L125 PetriNetUnfolderBase]: For 318/318 co-relation queries the response was YES. [2024-11-12 16:17:55,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10149 conditions, 5598 events. 2585/5598 cut-off events. For 318/318 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 46075 event pairs, 88 based on Foata normal form. 10/5384 useless extension candidates. Maximal degree in co-relation 9049. Up to 3921 conditions per place. [2024-11-12 16:17:55,313 INFO L140 encePairwiseOnDemand]: 81/85 looper letters, 64 selfloop transitions, 4 changer transitions 0/96 dead transitions. [2024-11-12 16:17:55,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 96 transitions, 358 flow [2024-11-12 16:17:55,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:17:55,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:17:55,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 189 transitions. [2024-11-12 16:17:55,315 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5558823529411765 [2024-11-12 16:17:55,315 INFO L175 Difference]: Start difference. First operand has 71 places, 66 transitions, 160 flow. Second operand 4 states and 189 transitions. [2024-11-12 16:17:55,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 96 transitions, 358 flow [2024-11-12 16:17:55,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 96 transitions, 356 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 16:17:55,318 INFO L231 Difference]: Finished difference. Result has 74 places, 67 transitions, 177 flow [2024-11-12 16:17:55,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=74, PETRI_TRANSITIONS=67} [2024-11-12 16:17:55,319 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 2 predicate places. [2024-11-12 16:17:55,319 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 177 flow [2024-11-12 16:17:55,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:17:55,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:17:55,320 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-12 16:17:55,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 16:17:55,320 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-12 16:17:55,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:17:55,321 INFO L85 PathProgramCache]: Analyzing trace with hash 451829300, now seen corresponding path program 1 times [2024-11-12 16:17:55,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:17:55,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513579584] [2024-11-12 16:17:55,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:17:55,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:17:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:17:55,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:17:55,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:17:55,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513579584] [2024-11-12 16:17:55,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513579584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:17:55,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:17:55,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:17:55,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63112350] [2024-11-12 16:17:55,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:17:55,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 16:17:55,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:17:55,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 16:17:55,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:17:55,521 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 85 [2024-11-12 16:17:55,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 67 transitions, 177 flow. Second operand has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:17:55,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:17:55,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 85 [2024-11-12 16:17:55,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:17:56,090 INFO L124 PetriNetUnfolderBase]: 2594/5519 cut-off events. [2024-11-12 16:17:56,091 INFO L125 PetriNetUnfolderBase]: For 665/665 co-relation queries the response was YES. [2024-11-12 16:17:56,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10312 conditions, 5519 events. 2594/5519 cut-off events. For 665/665 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 44489 event pairs, 96 based on Foata normal form. 100/5447 useless extension candidates. Maximal degree in co-relation 7476. Up to 3081 conditions per place. [2024-11-12 16:17:56,122 INFO L140 encePairwiseOnDemand]: 80/85 looper letters, 100 selfloop transitions, 6 changer transitions 0/133 dead transitions. [2024-11-12 16:17:56,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 133 transitions, 517 flow [2024-11-12 16:17:56,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:17:56,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 16:17:56,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 281 transitions. [2024-11-12 16:17:56,124 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5509803921568628 [2024-11-12 16:17:56,124 INFO L175 Difference]: Start difference. First operand has 74 places, 67 transitions, 177 flow. Second operand 6 states and 281 transitions. [2024-11-12 16:17:56,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 133 transitions, 517 flow [2024-11-12 16:17:56,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 133 transitions, 508 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-12 16:17:56,130 INFO L231 Difference]: Finished difference. Result has 77 places, 67 transitions, 181 flow [2024-11-12 16:17:56,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=181, PETRI_PLACES=77, PETRI_TRANSITIONS=67} [2024-11-12 16:17:56,132 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 5 predicate places. [2024-11-12 16:17:56,132 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 67 transitions, 181 flow [2024-11-12 16:17:56,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:17:56,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:17:56,133 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2024-11-12 16:17:56,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 16:17:56,135 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-12 16:17:56,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:17:56,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1121806825, now seen corresponding path program 1 times [2024-11-12 16:17:56,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:17:56,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265956594] [2024-11-12 16:17:56,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:17:56,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:17:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 16:17:56,156 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 16:17:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 16:17:56,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 16:17:56,181 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 16:17:56,181 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-12 16:17:56,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2024-11-12 16:17:56,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2024-11-12 16:17:56,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2024-11-12 16:17:56,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2024-11-12 16:17:56,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2024-11-12 16:17:56,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-12 16:17:56,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 16:17:56,183 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-12 16:17:56,184 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-12 16:17:56,184 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-12 16:17:56,208 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-12 16:17:56,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 110 transitions, 247 flow [2024-11-12 16:17:56,227 INFO L124 PetriNetUnfolderBase]: 42/248 cut-off events. [2024-11-12 16:17:56,228 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-12 16:17:56,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 248 events. 42/248 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1116 event pairs, 1 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 170. Up to 12 conditions per place. [2024-11-12 16:17:56,229 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 110 transitions, 247 flow [2024-11-12 16:17:56,231 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 110 transitions, 247 flow [2024-11-12 16:17:56,232 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 16:17:56,232 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;@2929c97b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 16:17:56,232 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-12 16:17:56,233 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 16:17:56,234 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-12 16:17:56,234 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 16:17:56,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:17:56,234 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-12 16:17:56,234 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-12 16:17:56,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:17:56,235 INFO L85 PathProgramCache]: Analyzing trace with hash 542760, now seen corresponding path program 1 times [2024-11-12 16:17:56,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:17:56,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424833027] [2024-11-12 16:17:56,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:17:56,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:17:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:17:56,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:17:56,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:17:56,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424833027] [2024-11-12 16:17:56,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424833027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:17:56,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:17:56,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 16:17:56,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001022536] [2024-11-12 16:17:56,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:17:56,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:17:56,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:17:56,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:17:56,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:17:56,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 110 [2024-11-12 16:17:56,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 110 transitions, 247 flow. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:17:56,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:17:56,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 110 [2024-11-12 16:17:56,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:18:02,636 INFO L124 PetriNetUnfolderBase]: 47447/78707 cut-off events. [2024-11-12 16:18:02,636 INFO L125 PetriNetUnfolderBase]: For 1236/1236 co-relation queries the response was YES. [2024-11-12 16:18:02,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145940 conditions, 78707 events. 47447/78707 cut-off events. For 1236/1236 co-relation queries the response was YES. Maximal size of possible extension queue 2012. Compared 706973 event pairs, 40780 based on Foata normal form. 23856/99464 useless extension candidates. Maximal degree in co-relation 53254. Up to 57237 conditions per place. [2024-11-12 16:18:03,140 INFO L140 encePairwiseOnDemand]: 84/110 looper letters, 74 selfloop transitions, 2 changer transitions 1/112 dead transitions. [2024-11-12 16:18:03,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 112 transitions, 405 flow [2024-11-12 16:18:03,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:18:03,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:18:03,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2024-11-12 16:18:03,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6787878787878788 [2024-11-12 16:18:03,143 INFO L175 Difference]: Start difference. First operand has 92 places, 110 transitions, 247 flow. Second operand 3 states and 224 transitions. [2024-11-12 16:18:03,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 112 transitions, 405 flow [2024-11-12 16:18:03,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 112 transitions, 405 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 16:18:03,151 INFO L231 Difference]: Finished difference. Result has 91 places, 84 transitions, 199 flow [2024-11-12 16:18:03,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=199, PETRI_PLACES=91, PETRI_TRANSITIONS=84} [2024-11-12 16:18:03,153 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, -1 predicate places. [2024-11-12 16:18:03,154 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 84 transitions, 199 flow [2024-11-12 16:18:03,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:18:03,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:18:03,155 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-12 16:18:03,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 16:18:03,156 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-12 16:18:03,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:18:03,156 INFO L85 PathProgramCache]: Analyzing trace with hash 542761, now seen corresponding path program 1 times [2024-11-12 16:18:03,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:18:03,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140529886] [2024-11-12 16:18:03,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:18:03,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:18:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:18:03,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:18:03,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:18:03,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140529886] [2024-11-12 16:18:03,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140529886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:18:03,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:18:03,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 16:18:03,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683831145] [2024-11-12 16:18:03,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:18:03,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:18:03,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:18:03,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:18:03,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:18:03,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 110 [2024-11-12 16:18:03,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 84 transitions, 199 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:18:03,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:18:03,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 110 [2024-11-12 16:18:03,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:18:08,214 INFO L124 PetriNetUnfolderBase]: 40912/69187 cut-off events. [2024-11-12 16:18:08,215 INFO L125 PetriNetUnfolderBase]: For 2262/2336 co-relation queries the response was YES. [2024-11-12 16:18:08,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128547 conditions, 69187 events. 40912/69187 cut-off events. For 2262/2336 co-relation queries the response was YES. Maximal size of possible extension queue 1824. Compared 621202 event pairs, 40771 based on Foata normal form. 1/66026 useless extension candidates. Maximal degree in co-relation 116944. Up to 57216 conditions per place. [2024-11-12 16:18:08,586 INFO L140 encePairwiseOnDemand]: 106/110 looper letters, 57 selfloop transitions, 2 changer transitions 0/95 dead transitions. [2024-11-12 16:18:08,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 95 transitions, 339 flow [2024-11-12 16:18:08,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:18:08,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:18:08,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2024-11-12 16:18:08,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2024-11-12 16:18:08,588 INFO L175 Difference]: Start difference. First operand has 91 places, 84 transitions, 199 flow. Second operand 3 states and 175 transitions. [2024-11-12 16:18:08,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 95 transitions, 339 flow [2024-11-12 16:18:08,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 95 transitions, 335 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:18:08,710 INFO L231 Difference]: Finished difference. Result has 91 places, 85 transitions, 209 flow [2024-11-12 16:18:08,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=209, PETRI_PLACES=91, PETRI_TRANSITIONS=85} [2024-11-12 16:18:08,713 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, -1 predicate places. [2024-11-12 16:18:08,714 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 85 transitions, 209 flow [2024-11-12 16:18:08,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:18:08,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:18:08,714 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-12 16:18:08,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 16:18:08,714 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-12 16:18:08,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:18:08,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1243199841, now seen corresponding path program 1 times [2024-11-12 16:18:08,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:18:08,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116938579] [2024-11-12 16:18:08,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:18:08,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:18:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:18:08,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:18:08,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:18:08,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116938579] [2024-11-12 16:18:08,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116938579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:18:08,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:18:08,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:18:08,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620700221] [2024-11-12 16:18:08,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:18:08,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:18:08,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:18:08,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:18:08,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:18:08,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 110 [2024-11-12 16:18:08,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 85 transitions, 209 flow. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:18:08,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:18:08,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 110 [2024-11-12 16:18:08,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:18:13,414 INFO L124 PetriNetUnfolderBase]: 40830/71213 cut-off events. [2024-11-12 16:18:13,415 INFO L125 PetriNetUnfolderBase]: For 3991/3991 co-relation queries the response was YES. [2024-11-12 16:18:13,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131302 conditions, 71213 events. 40830/71213 cut-off events. For 3991/3991 co-relation queries the response was YES. Maximal size of possible extension queue 2021. Compared 683186 event pairs, 7679 based on Foata normal form. 1120/70357 useless extension candidates. Maximal degree in co-relation 131219. Up to 42067 conditions per place. [2024-11-12 16:18:13,787 INFO L140 encePairwiseOnDemand]: 105/110 looper letters, 110 selfloop transitions, 5 changer transitions 0/150 dead transitions. [2024-11-12 16:18:13,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 150 transitions, 567 flow [2024-11-12 16:18:13,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:18:13,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 16:18:13,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 302 transitions. [2024-11-12 16:18:13,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5490909090909091 [2024-11-12 16:18:13,789 INFO L175 Difference]: Start difference. First operand has 91 places, 85 transitions, 209 flow. Second operand 5 states and 302 transitions. [2024-11-12 16:18:13,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 150 transitions, 567 flow [2024-11-12 16:18:13,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 150 transitions, 565 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 16:18:13,793 INFO L231 Difference]: Finished difference. Result has 94 places, 85 transitions, 220 flow [2024-11-12 16:18:13,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=220, PETRI_PLACES=94, PETRI_TRANSITIONS=85} [2024-11-12 16:18:13,794 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 2 predicate places. [2024-11-12 16:18:13,794 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 85 transitions, 220 flow [2024-11-12 16:18:13,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:18:13,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:18:13,794 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1] [2024-11-12 16:18:13,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 16:18:13,795 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-12 16:18:13,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:18:13,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1252634362, now seen corresponding path program 1 times [2024-11-12 16:18:13,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:18:13,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059207299] [2024-11-12 16:18:13,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:18:13,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:18:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 16:18:13,815 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 16:18:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 16:18:13,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 16:18:13,841 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 16:18:13,842 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-12 16:18:13,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2024-11-12 16:18:13,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2024-11-12 16:18:13,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2024-11-12 16:18:13,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2024-11-12 16:18:13,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2024-11-12 16:18:13,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-12 16:18:13,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 16:18:13,844 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-12 16:18:13,845 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-12 16:18:13,846 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-12 16:18:13,883 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-12 16:18:13,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 135 transitions, 310 flow [2024-11-12 16:18:13,921 INFO L124 PetriNetUnfolderBase]: 65/381 cut-off events. [2024-11-12 16:18:13,922 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-12 16:18:13,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 381 events. 65/381 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1857 event pairs, 6 based on Foata normal form. 0/253 useless extension candidates. Maximal degree in co-relation 272. Up to 32 conditions per place. [2024-11-12 16:18:13,926 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 135 transitions, 310 flow [2024-11-12 16:18:13,929 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 135 transitions, 310 flow [2024-11-12 16:18:13,932 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 16:18:13,933 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;@2929c97b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 16:18:13,933 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-12 16:18:13,934 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 16:18:13,935 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-12 16:18:13,935 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 16:18:13,935 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:18:13,935 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-12 16:18:13,937 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-12 16:18:13,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:18:13,938 INFO L85 PathProgramCache]: Analyzing trace with hash 676815, now seen corresponding path program 1 times [2024-11-12 16:18:13,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:18:13,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531640913] [2024-11-12 16:18:13,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:18:13,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:18:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:18:13,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:18:13,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:18:13,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531640913] [2024-11-12 16:18:13,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531640913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:18:13,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:18:13,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 16:18:13,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88217438] [2024-11-12 16:18:13,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:18:13,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:18:13,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:18:13,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:18:13,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:18:13,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 135 [2024-11-12 16:18:13,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 135 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:18:13,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:18:13,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 135 [2024-11-12 16:18:13,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand