./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_22-deref_read_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_22-deref_read_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ce97f399f5ab540e05119d9433f4e1bfecfe892f8e87faddc6435387a55a4d6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:23:35,428 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:23:35,492 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:23:35,510 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:23:35,510 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:23:35,527 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:23:35,528 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:23:35,529 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:23:35,529 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:23:35,529 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:23:35,529 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:23:35,530 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:23:35,530 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:23:35,530 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:23:35,530 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:23:35,531 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:23:35,531 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:23:35,531 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:23:35,531 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:23:35,532 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:23:35,532 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:23:35,535 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:23:35,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:23:35,535 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:23:35,536 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:23:35,536 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:23:35,536 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:23:35,536 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:23:35,537 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:23:35,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:23:35,540 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:23:35,540 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:23:35,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:23:35,540 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:23:35,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:23:35,540 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:23:35,541 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:23:35,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:23:35,541 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:23:35,541 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:23:35,541 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:23:35,542 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:23:35,542 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 ! call(reach_error())) ) 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 -> 4ce97f399f5ab540e05119d9433f4e1bfecfe892f8e87faddc6435387a55a4d6 [2024-11-10 10:23:35,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:23:35,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:23:35,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:23:35,778 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:23:35,778 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:23:35,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_22-deref_read_racefree.i [2024-11-10 10:23:36,990 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:23:37,224 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:23:37,225 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_22-deref_read_racefree.i [2024-11-10 10:23:37,238 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f1c1beec/f15d67b4e6e54317989caf34142e07a6/FLAG6e725e619 [2024-11-10 10:23:37,583 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f1c1beec/f15d67b4e6e54317989caf34142e07a6 [2024-11-10 10:23:37,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:23:37,586 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:23:37,589 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:23:37,589 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:23:37,593 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:23:37,593 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:23:37" (1/1) ... [2024-11-10 10:23:37,594 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a1ac3b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:23:37, skipping insertion in model container [2024-11-10 10:23:37,594 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:23:37" (1/1) ... [2024-11-10 10:23:37,625 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:23:37,905 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_22-deref_read_racefree.i[30176,30189] [2024-11-10 10:23:37,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:23:37,942 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:23:37,966 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_22-deref_read_racefree.i[30176,30189] [2024-11-10 10:23:37,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:23:38,033 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:23:38,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:23:38 WrapperNode [2024-11-10 10:23:38,036 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:23:38,037 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:23:38,037 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:23:38,037 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:23:38,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:23:38" (1/1) ... [2024-11-10 10:23:38,074 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:23:38" (1/1) ... [2024-11-10 10:23:38,100 INFO L138 Inliner]: procedures = 170, calls = 37, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 66 [2024-11-10 10:23:38,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:23:38,101 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:23:38,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:23:38,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:23:38,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:23:38" (1/1) ... [2024-11-10 10:23:38,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:23:38" (1/1) ... [2024-11-10 10:23:38,111 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:23:38" (1/1) ... [2024-11-10 10:23:38,122 INFO L175 MemorySlicer]: Split 18 memory accesses to 4 slices as follows [2, 5, 6, 5]. 33 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 1, 5]. The 2 writes are split as follows [0, 0, 2, 0]. [2024-11-10 10:23:38,122 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:23:38" (1/1) ... [2024-11-10 10:23:38,123 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:23:38" (1/1) ... [2024-11-10 10:23:38,127 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:23:38" (1/1) ... [2024-11-10 10:23:38,127 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:23:38" (1/1) ... [2024-11-10 10:23:38,128 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:23:38" (1/1) ... [2024-11-10 10:23:38,129 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:23:38" (1/1) ... [2024-11-10 10:23:38,130 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:23:38,131 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:23:38,131 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:23:38,131 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:23:38,132 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:23:38" (1/1) ... [2024-11-10 10:23:38,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:23:38,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:23:38,163 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-10 10:23:38,173 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-10 10:23:38,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 10:23:38,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 10:23:38,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 10:23:38,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-10 10:23:38,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 10:23:38,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 10:23:38,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 10:23:38,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-10 10:23:38,214 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 10:23:38,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:23:38,214 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-10 10:23:38,215 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-10 10:23:38,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 10:23:38,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 10:23:38,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 10:23:38,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-10 10:23:38,216 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 10:23:38,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:23:38,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:23:38,218 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 10:23:38,334 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:23:38,336 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:23:38,495 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 10:23:38,495 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:23:38,606 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:23:38,607 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:23:38,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:23:38 BoogieIcfgContainer [2024-11-10 10:23:38,607 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:23:38,609 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:23:38,610 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:23:38,613 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:23:38,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:23:37" (1/3) ... [2024-11-10 10:23:38,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d6f62d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:23:38, skipping insertion in model container [2024-11-10 10:23:38,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:23:38" (2/3) ... [2024-11-10 10:23:38,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d6f62d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:23:38, skipping insertion in model container [2024-11-10 10:23:38,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:23:38" (3/3) ... [2024-11-10 10:23:38,618 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_22-deref_read_racefree.i [2024-11-10 10:23:38,630 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:23:38,631 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 10:23:38,631 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 10:23:38,663 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 10:23:38,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 51 transitions, 106 flow [2024-11-10 10:23:38,730 INFO L124 PetriNetUnfolderBase]: 14/73 cut-off events. [2024-11-10 10:23:38,731 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:23:38,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 73 events. 14/73 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 210 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 48. Up to 4 conditions per place. [2024-11-10 10:23:38,735 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 51 transitions, 106 flow [2024-11-10 10:23:38,738 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 51 transitions, 106 flow [2024-11-10 10:23:38,745 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:23:38,750 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=LoopHeads, 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;@207a63b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:23:38,750 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 10:23:38,756 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:23:38,756 INFO L124 PetriNetUnfolderBase]: 2/22 cut-off events. [2024-11-10 10:23:38,756 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:23:38,756 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:23:38,757 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1] [2024-11-10 10:23:38,757 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:23:38,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:23:38,762 INFO L85 PathProgramCache]: Analyzing trace with hash 384931371, now seen corresponding path program 1 times [2024-11-10 10:23:38,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:23:38,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360980410] [2024-11-10 10:23:38,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:23:38,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:23:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:23:38,872 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:23:38,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:23:38,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:23:38,928 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:23:38,929 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-10 10:23:38,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-10 10:23:38,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:23:38,931 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-10 10:23:38,934 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 10:23:38,934 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-10 10:23:38,950 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 10:23:38,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 77 transitions, 164 flow [2024-11-10 10:23:38,971 INFO L124 PetriNetUnfolderBase]: 24/122 cut-off events. [2024-11-10 10:23:38,974 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 10:23:38,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 122 events. 24/122 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 447 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 76. Up to 6 conditions per place. [2024-11-10 10:23:38,976 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 77 transitions, 164 flow [2024-11-10 10:23:38,978 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 77 transitions, 164 flow [2024-11-10 10:23:38,980 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:23:38,980 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=LoopHeads, 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;@207a63b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:23:38,981 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 10:23:38,993 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:23:38,993 INFO L124 PetriNetUnfolderBase]: 6/50 cut-off events. [2024-11-10 10:23:38,993 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 10:23:38,994 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:23:38,994 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:23:38,994 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:23:38,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:23:38,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1101558255, now seen corresponding path program 1 times [2024-11-10 10:23:38,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:23:38,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889144664] [2024-11-10 10:23:38,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:23:38,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:23:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:23:39,055 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-10 10:23:39,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:23:39,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889144664] [2024-11-10 10:23:39,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889144664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:23:39,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:23:39,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:23:39,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297454675] [2024-11-10 10:23:39,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:23:39,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:23:39,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:23:39,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:23:39,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:23:39,090 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2024-11-10 10:23:39,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 77 transitions, 164 flow. Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 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-10 10:23:39,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:23:39,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2024-11-10 10:23:39,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:23:39,627 INFO L124 PetriNetUnfolderBase]: 2169/4543 cut-off events. [2024-11-10 10:23:39,627 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-11-10 10:23:39,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8079 conditions, 4543 events. 2169/4543 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 34185 event pairs, 2169 based on Foata normal form. 1879/6290 useless extension candidates. Maximal degree in co-relation 5901. Up to 3501 conditions per place. [2024-11-10 10:23:39,659 INFO L140 encePairwiseOnDemand]: 61/77 looper letters, 28 selfloop transitions, 0 changer transitions 6/61 dead transitions. [2024-11-10 10:23:39,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 61 transitions, 196 flow [2024-11-10 10:23:39,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 10:23:39,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 10:23:39,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 106 transitions. [2024-11-10 10:23:39,670 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6883116883116883 [2024-11-10 10:23:39,671 INFO L175 Difference]: Start difference. First operand has 66 places, 77 transitions, 164 flow. Second operand 2 states and 106 transitions. [2024-11-10 10:23:39,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 61 transitions, 196 flow [2024-11-10 10:23:39,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 61 transitions, 196 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:23:39,677 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 120 flow [2024-11-10 10:23:39,679 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=120, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2024-11-10 10:23:39,682 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 1 predicate places. [2024-11-10 10:23:39,683 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 120 flow [2024-11-10 10:23:39,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 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-10 10:23:39,683 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:23:39,684 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:23:39,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:23:39,684 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:23:39,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:23:39,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1158531440, now seen corresponding path program 1 times [2024-11-10 10:23:39,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:23:39,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506670331] [2024-11-10 10:23:39,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:23:39,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:23:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:23:39,813 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-10 10:23:39,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:23:39,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506670331] [2024-11-10 10:23:39,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506670331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:23:39,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:23:39,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:23:39,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17539009] [2024-11-10 10:23:39,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:23:39,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:23:39,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:23:39,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:23:39,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:23:39,820 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 77 [2024-11-10 10:23:39,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-10 10:23:39,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:23:39,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 77 [2024-11-10 10:23:39,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:23:40,187 INFO L124 PetriNetUnfolderBase]: 1602/3415 cut-off events. [2024-11-10 10:23:40,187 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-11-10 10:23:40,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6046 conditions, 3415 events. 1602/3415 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 24986 event pairs, 720 based on Foata normal form. 0/3249 useless extension candidates. Maximal degree in co-relation 6041. Up to 2583 conditions per place. [2024-11-10 10:23:40,204 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 38 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2024-11-10 10:23:40,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 66 transitions, 222 flow [2024-11-10 10:23:40,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:23:40,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:23:40,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2024-11-10 10:23:40,208 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5411255411255411 [2024-11-10 10:23:40,208 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 120 flow. Second operand 3 states and 125 transitions. [2024-11-10 10:23:40,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 66 transitions, 222 flow [2024-11-10 10:23:40,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 66 transitions, 222 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:23:40,211 INFO L231 Difference]: Finished difference. Result has 64 places, 56 transitions, 132 flow [2024-11-10 10:23:40,212 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=64, PETRI_TRANSITIONS=56} [2024-11-10 10:23:40,212 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, -2 predicate places. [2024-11-10 10:23:40,213 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 56 transitions, 132 flow [2024-11-10 10:23:40,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-10 10:23:40,214 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:23:40,214 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2024-11-10 10:23:40,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 10:23:40,214 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:23:40,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:23:40,215 INFO L85 PathProgramCache]: Analyzing trace with hash -758549178, now seen corresponding path program 1 times [2024-11-10 10:23:40,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:23:40,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535046496] [2024-11-10 10:23:40,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:23:40,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:23:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:23:40,237 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:23:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:23:40,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:23:40,264 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:23:40,264 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-10 10:23:40,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-10 10:23:40,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 10:23:40,265 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 10:23:40,265 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 10:23:40,265 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-10 10:23:40,284 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 10:23:40,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 103 transitions, 224 flow [2024-11-10 10:23:40,304 INFO L124 PetriNetUnfolderBase]: 34/171 cut-off events. [2024-11-10 10:23:40,306 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-10 10:23:40,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 171 events. 34/171 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 686 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 129. Up to 8 conditions per place. [2024-11-10 10:23:40,308 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 103 transitions, 224 flow [2024-11-10 10:23:40,310 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 103 transitions, 224 flow [2024-11-10 10:23:40,311 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:23:40,312 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=LoopHeads, 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;@207a63b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:23:40,312 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 10:23:40,317 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:23:40,317 INFO L124 PetriNetUnfolderBase]: 6/50 cut-off events. [2024-11-10 10:23:40,317 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 10:23:40,317 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:23:40,318 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:23:40,318 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:23:40,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:23:40,319 INFO L85 PathProgramCache]: Analyzing trace with hash -57179569, now seen corresponding path program 1 times [2024-11-10 10:23:40,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:23:40,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619279101] [2024-11-10 10:23:40,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:23:40,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:23:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:23:40,340 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-10 10:23:40,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:23:40,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619279101] [2024-11-10 10:23:40,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619279101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:23:40,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:23:40,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:23:40,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84779907] [2024-11-10 10:23:40,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:23:40,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:23:40,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:23:40,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:23:40,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:23:40,346 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 103 [2024-11-10 10:23:40,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 103 transitions, 224 flow. Second operand has 2 states, 2 states have (on average 42.5) internal successors, (85), 2 states have internal predecessors, (85), 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-10 10:23:40,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:23:40,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 103 [2024-11-10 10:23:40,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:23:44,862 INFO L124 PetriNetUnfolderBase]: 33669/57073 cut-off events. [2024-11-10 10:23:44,862 INFO L125 PetriNetUnfolderBase]: For 705/705 co-relation queries the response was YES. [2024-11-10 10:23:44,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104510 conditions, 57073 events. 33669/57073 cut-off events. For 705/705 co-relation queries the response was YES. Maximal size of possible extension queue 1619. Compared 514326 event pairs, 33669 based on Foata normal form. 26465/81862 useless extension candidates. Maximal degree in co-relation 52476. Up to 47001 conditions per place. [2024-11-10 10:23:45,099 INFO L140 encePairwiseOnDemand]: 81/103 looper letters, 38 selfloop transitions, 0 changer transitions 6/81 dead transitions. [2024-11-10 10:23:45,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 81 transitions, 264 flow [2024-11-10 10:23:45,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 10:23:45,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 10:23:45,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 142 transitions. [2024-11-10 10:23:45,104 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6893203883495146 [2024-11-10 10:23:45,104 INFO L175 Difference]: Start difference. First operand has 88 places, 103 transitions, 224 flow. Second operand 2 states and 142 transitions. [2024-11-10 10:23:45,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 81 transitions, 264 flow [2024-11-10 10:23:45,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 81 transitions, 262 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-11-10 10:23:45,108 INFO L231 Difference]: Finished difference. Result has 89 places, 75 transitions, 166 flow [2024-11-10 10:23:45,108 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=166, PETRI_PLACES=89, PETRI_TRANSITIONS=75} [2024-11-10 10:23:45,109 INFO L277 CegarLoopForPetriNet]: 88 programPoint places, 1 predicate places. [2024-11-10 10:23:45,110 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 75 transitions, 166 flow [2024-11-10 10:23:45,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 42.5) internal successors, (85), 2 states have internal predecessors, (85), 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-10 10:23:45,110 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:23:45,110 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:23:45,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 10:23:45,111 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:23:45,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:23:45,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1575301783, now seen corresponding path program 1 times [2024-11-10 10:23:45,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:23:45,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6529673] [2024-11-10 10:23:45,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:23:45,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:23:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:23:45,151 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-10 10:23:45,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:23:45,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6529673] [2024-11-10 10:23:45,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6529673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:23:45,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:23:45,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:23:45,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987805978] [2024-11-10 10:23:45,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:23:45,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:23:45,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:23:45,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:23:45,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:23:45,160 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 103 [2024-11-10 10:23:45,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 75 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-10 10:23:45,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:23:45,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 103 [2024-11-10 10:23:45,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:23:47,802 INFO L124 PetriNetUnfolderBase]: 25002/42706 cut-off events. [2024-11-10 10:23:47,802 INFO L125 PetriNetUnfolderBase]: For 387/387 co-relation queries the response was YES. [2024-11-10 10:23:47,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78038 conditions, 42706 events. 25002/42706 cut-off events. For 387/387 co-relation queries the response was YES. Maximal size of possible extension queue 1280. Compared 374046 event pairs, 23996 based on Foata normal form. 0/40449 useless extension candidates. Maximal degree in co-relation 78032. Up to 34983 conditions per place. [2024-11-10 10:23:48,192 INFO L140 encePairwiseOnDemand]: 100/103 looper letters, 48 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2024-11-10 10:23:48,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 86 transitions, 288 flow [2024-11-10 10:23:48,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:23:48,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:23:48,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2024-11-10 10:23:48,197 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5339805825242718 [2024-11-10 10:23:48,197 INFO L175 Difference]: Start difference. First operand has 89 places, 75 transitions, 166 flow. Second operand 3 states and 165 transitions. [2024-11-10 10:23:48,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 86 transitions, 288 flow [2024-11-10 10:23:48,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 86 transitions, 288 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:23:48,202 INFO L231 Difference]: Finished difference. Result has 86 places, 76 transitions, 178 flow [2024-11-10 10:23:48,202 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=86, PETRI_TRANSITIONS=76} [2024-11-10 10:23:48,203 INFO L277 CegarLoopForPetriNet]: 88 programPoint places, -2 predicate places. [2024-11-10 10:23:48,204 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 76 transitions, 178 flow [2024-11-10 10:23:48,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-10 10:23:48,204 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:23:48,204 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:23:48,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 10:23:48,205 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:23:48,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:23:48,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1559773002, now seen corresponding path program 1 times [2024-11-10 10:23:48,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:23:48,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052501353] [2024-11-10 10:23:48,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:23:48,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:23:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:23:48,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:23:48,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:23:48,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052501353] [2024-11-10 10:23:48,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052501353] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:23:48,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736368339] [2024-11-10 10:23:48,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:23:48,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:23:48,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:23:48,260 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:23:48,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 10:23:48,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:23:48,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 10:23:48,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:23:48,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:23:48,389 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:23:48,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:23:48,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736368339] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:23:48,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:23:48,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-10 10:23:48,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749330759] [2024-11-10 10:23:48,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:23:48,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:23:48,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:23:48,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:23:48,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:23:48,411 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 103 [2024-11-10 10:23:48,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 76 transitions, 178 flow. Second operand has 7 states, 7 states have (on average 40.714285714285715) internal successors, (285), 7 states have internal predecessors, (285), 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-10 10:23:48,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:23:48,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 103 [2024-11-10 10:23:48,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:23:49,247 INFO L124 PetriNetUnfolderBase]: 7668/13921 cut-off events. [2024-11-10 10:23:49,248 INFO L125 PetriNetUnfolderBase]: For 3119/3119 co-relation queries the response was YES. [2024-11-10 10:23:49,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26382 conditions, 13921 events. 7668/13921 cut-off events. For 3119/3119 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 112704 event pairs, 800 based on Foata normal form. 1110/14898 useless extension candidates. Maximal degree in co-relation 26374. Up to 7400 conditions per place. [2024-11-10 10:23:49,311 INFO L140 encePairwiseOnDemand]: 100/103 looper letters, 88 selfloop transitions, 4 changer transitions 0/124 dead transitions. [2024-11-10 10:23:49,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 124 transitions, 458 flow [2024-11-10 10:23:49,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:23:49,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:23:49,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 323 transitions. [2024-11-10 10:23:49,313 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5226537216828478 [2024-11-10 10:23:49,313 INFO L175 Difference]: Start difference. First operand has 86 places, 76 transitions, 178 flow. Second operand 6 states and 323 transitions. [2024-11-10 10:23:49,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 124 transitions, 458 flow [2024-11-10 10:23:49,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 124 transitions, 456 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 10:23:49,317 INFO L231 Difference]: Finished difference. Result has 80 places, 67 transitions, 166 flow [2024-11-10 10:23:49,317 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=166, PETRI_PLACES=80, PETRI_TRANSITIONS=67} [2024-11-10 10:23:49,317 INFO L277 CegarLoopForPetriNet]: 88 programPoint places, -8 predicate places. [2024-11-10 10:23:49,318 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 67 transitions, 166 flow [2024-11-10 10:23:49,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 40.714285714285715) internal successors, (285), 7 states have internal predecessors, (285), 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-10 10:23:49,318 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:23:49,318 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1] [2024-11-10 10:23:49,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 10:23:49,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:23:49,523 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:23:49,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:23:49,523 INFO L85 PathProgramCache]: Analyzing trace with hash -37299820, now seen corresponding path program 1 times [2024-11-10 10:23:49,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:23:49,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160437526] [2024-11-10 10:23:49,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:23:49,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:23:49,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:23:49,537 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:23:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:23:49,549 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:23:49,550 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:23:49,550 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-10 10:23:49,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-10 10:23:49,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 10:23:49,550 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-10 10:23:49,551 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 10:23:49,551 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-10 10:23:49,574 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 10:23:49,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 129 transitions, 286 flow [2024-11-10 10:23:49,587 INFO L124 PetriNetUnfolderBase]: 44/220 cut-off events. [2024-11-10 10:23:49,588 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-10 10:23:49,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 220 events. 44/220 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 876 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 183. Up to 10 conditions per place. [2024-11-10 10:23:49,589 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 129 transitions, 286 flow [2024-11-10 10:23:49,590 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 129 transitions, 286 flow [2024-11-10 10:23:49,591 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:23:49,592 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=LoopHeads, 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;@207a63b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:23:49,593 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 10:23:49,595 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:23:49,595 INFO L124 PetriNetUnfolderBase]: 6/50 cut-off events. [2024-11-10 10:23:49,595 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 10:23:49,595 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:23:49,595 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:23:49,595 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:23:49,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:23:49,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1341619473, now seen corresponding path program 1 times [2024-11-10 10:23:49,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:23:49,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531246277] [2024-11-10 10:23:49,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:23:49,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:23:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:23:49,611 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-10 10:23:49,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:23:49,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531246277] [2024-11-10 10:23:49,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531246277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:23:49,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:23:49,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:23:49,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243657738] [2024-11-10 10:23:49,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:23:49,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:23:49,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:23:49,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:23:49,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:23:49,612 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 129 [2024-11-10 10:23:49,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 129 transitions, 286 flow. Second operand has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 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-10 10:23:49,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:23:49,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 129 [2024-11-10 10:23:49,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand