./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/46_monabsex2_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/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 ../../../trunk/examples/svcomp/pthread-ext/46_monabsex2_vs.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 134e9604c8f91a200c8250c9fbb45867ed525dc78e65c16e0a5fa44f5d71ac67 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 16:21:48,242 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 16:21:48,354 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 16:21:48,359 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 16:21:48,360 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 16:21:48,383 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 16:21:48,383 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 16:21:48,384 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 16:21:48,384 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 16:21:48,389 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 16:21:48,389 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 16:21:48,390 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 16:21:48,391 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 16:21:48,392 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 16:21:48,392 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 16:21:48,392 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 16:21:48,392 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 16:21:48,393 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 16:21:48,393 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 16:21:48,393 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 16:21:48,393 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 16:21:48,394 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 16:21:48,394 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 16:21:48,394 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 16:21:48,394 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 16:21:48,394 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 16:21:48,395 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 16:21:48,395 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 16:21:48,395 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 16:21:48,396 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 16:21:48,396 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 16:21:48,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 16:21:48,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:21:48,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 16:21:48,397 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 16:21:48,397 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 16:21:48,398 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 16:21:48,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 16:21:48,398 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 16:21:48,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 16:21:48,398 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 16:21:48,398 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 16:21:48,399 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 16:21:48,399 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 -> 134e9604c8f91a200c8250c9fbb45867ed525dc78e65c16e0a5fa44f5d71ac67 [2024-06-27 16:21:48,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 16:21:48,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 16:21:48,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 16:21:48,620 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 16:21:48,621 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 16:21:48,622 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/46_monabsex2_vs.i [2024-06-27 16:21:49,741 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 16:21:49,952 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 16:21:49,953 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/46_monabsex2_vs.i [2024-06-27 16:21:49,964 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/264c26b35/6ee02d5870654543b883795123d6f607/FLAG7cf68ca9f [2024-06-27 16:21:49,976 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/264c26b35/6ee02d5870654543b883795123d6f607 [2024-06-27 16:21:49,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 16:21:49,980 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 16:21:49,981 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 16:21:49,981 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 16:21:49,985 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 16:21:49,986 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:21:49" (1/1) ... [2024-06-27 16:21:49,987 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@714748fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:49, skipping insertion in model container [2024-06-27 16:21:49,987 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:21:49" (1/1) ... [2024-06-27 16:21:50,028 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 16:21:50,316 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/46_monabsex2_vs.i[30494,30507] [2024-06-27 16:21:50,334 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:21:50,342 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 16:21:50,370 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/46_monabsex2_vs.i[30494,30507] [2024-06-27 16:21:50,377 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:21:50,410 INFO L206 MainTranslator]: Completed translation [2024-06-27 16:21:50,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:50 WrapperNode [2024-06-27 16:21:50,411 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 16:21:50,413 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 16:21:50,413 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 16:21:50,413 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 16:21:50,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:50" (1/1) ... [2024-06-27 16:21:50,437 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:50" (1/1) ... [2024-06-27 16:21:50,453 INFO L138 Inliner]: procedures = 168, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2024-06-27 16:21:50,454 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 16:21:50,455 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 16:21:50,455 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 16:21:50,455 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 16:21:50,471 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:50" (1/1) ... [2024-06-27 16:21:50,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:50" (1/1) ... [2024-06-27 16:21:50,482 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:50" (1/1) ... [2024-06-27 16:21:50,497 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 16:21:50,512 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:50" (1/1) ... [2024-06-27 16:21:50,512 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:50" (1/1) ... [2024-06-27 16:21:50,515 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:50" (1/1) ... [2024-06-27 16:21:50,517 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:50" (1/1) ... [2024-06-27 16:21:50,518 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:50" (1/1) ... [2024-06-27 16:21:50,519 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:50" (1/1) ... [2024-06-27 16:21:50,522 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 16:21:50,523 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 16:21:50,523 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 16:21:50,523 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 16:21:50,524 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:50" (1/1) ... [2024-06-27 16:21:50,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:21:50,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:21:50,553 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-06-27 16:21:50,570 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-06-27 16:21:50,598 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-06-27 16:21:50,598 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-06-27 16:21:50,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 16:21:50,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 16:21:50,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 16:21:50,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 16:21:50,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 16:21:50,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 16:21:50,601 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 16:21:50,711 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 16:21:50,713 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 16:21:50,791 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 16:21:50,791 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 16:21:50,830 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 16:21:50,831 INFO L320 CfgBuilder]: Removed 1 assume(true) statements. [2024-06-27 16:21:50,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:21:50 BoogieIcfgContainer [2024-06-27 16:21:50,831 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 16:21:50,833 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 16:21:50,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 16:21:50,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 16:21:50,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 04:21:49" (1/3) ... [2024-06-27 16:21:50,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3039cde6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:21:50, skipping insertion in model container [2024-06-27 16:21:50,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:50" (2/3) ... [2024-06-27 16:21:50,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3039cde6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:21:50, skipping insertion in model container [2024-06-27 16:21:50,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:21:50" (3/3) ... [2024-06-27 16:21:50,838 INFO L112 eAbstractionObserver]: Analyzing ICFG 46_monabsex2_vs.i [2024-06-27 16:21:50,844 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 16:21:50,852 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 16:21:50,853 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 16:21:50,853 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 16:21:50,875 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 16:21:50,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 14 places, 11 transitions, 26 flow [2024-06-27 16:21:50,913 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2024-06-27 16:21:50,913 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 16:21:50,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17 conditions, 13 events. 0/13 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/10 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-06-27 16:21:50,915 INFO L82 GeneralOperation]: Start removeDead. Operand has 14 places, 11 transitions, 26 flow [2024-06-27 16:21:50,917 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 14 places, 11 transitions, 26 flow [2024-06-27 16:21:50,924 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:21:50,929 INFO L357 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, mHoare=true, 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;@7a6ddc0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:21:50,930 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-06-27 16:21:50,933 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:21:50,933 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-27 16:21:50,933 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 16:21:50,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:50,934 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-06-27 16:21:50,934 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-06-27 16:21:50,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:50,938 INFO L85 PathProgramCache]: Analyzing trace with hash 101289086, now seen corresponding path program 1 times [2024-06-27 16:21:50,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:50,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679937182] [2024-06-27 16:21:50,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:50,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:51,031 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 16:21:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:51,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 16:21:51,063 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 16:21:51,064 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-06-27 16:21:51,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-06-27 16:21:51,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-06-27 16:21:51,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 16:21:51,067 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-06-27 16:21:51,069 WARN L234 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-27 16:21:51,070 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-06-27 16:21:51,085 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 16:21:51,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 18 transitions, 46 flow [2024-06-27 16:21:51,099 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2024-06-27 16:21:51,099 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 16:21:51,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 22 events. 0/22 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 39 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2024-06-27 16:21:51,099 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 18 transitions, 46 flow [2024-06-27 16:21:51,105 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 18 transitions, 46 flow [2024-06-27 16:21:51,106 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:21:51,107 INFO L357 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, mHoare=true, 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;@7a6ddc0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:21:51,107 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-27 16:21:51,110 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:21:51,110 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-06-27 16:21:51,110 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-06-27 16:21:51,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:51,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 16:21:51,111 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-06-27 16:21:51,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:51,111 INFO L85 PathProgramCache]: Analyzing trace with hash 118472622, now seen corresponding path program 1 times [2024-06-27 16:21:51,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:51,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059982256] [2024-06-27 16:21:51,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:51,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:21:51,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:21:51,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:21:51,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059982256] [2024-06-27 16:21:51,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059982256] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:21:51,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:21:51,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 16:21:51,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455108631] [2024-06-27 16:21:51,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:21:51,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:21:51,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:21:51,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:21:51,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:21:51,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 18 [2024-06-27 16:21:51,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-06-27 16:21:51,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:21:51,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 18 [2024-06-27 16:21:51,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:21:51,587 INFO L124 PetriNetUnfolderBase]: 47/107 cut-off events. [2024-06-27 16:21:51,589 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-06-27 16:21:51,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 107 events. 47/107 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 365 event pairs, 15 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 111. Up to 77 conditions per place. [2024-06-27 16:21:51,596 INFO L140 encePairwiseOnDemand]: 12/18 looper letters, 15 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2024-06-27 16:21:51,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 23 transitions, 97 flow [2024-06-27 16:21:51,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:21:51,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:21:51,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2024-06-27 16:21:51,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2024-06-27 16:21:51,607 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 46 flow. Second operand 3 states and 37 transitions. [2024-06-27 16:21:51,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 23 transitions, 97 flow [2024-06-27 16:21:51,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 23 transitions, 97 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 16:21:51,611 INFO L231 Difference]: Finished difference. Result has 25 places, 19 transitions, 65 flow [2024-06-27 16:21:51,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2024-06-27 16:21:51,615 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 2 predicate places. [2024-06-27 16:21:51,616 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 65 flow [2024-06-27 16:21:51,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-06-27 16:21:51,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:51,616 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1] [2024-06-27 16:21:51,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 16:21:51,618 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-06-27 16:21:51,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:51,618 INFO L85 PathProgramCache]: Analyzing trace with hash -2112185491, now seen corresponding path program 1 times [2024-06-27 16:21:51,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:51,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147984798] [2024-06-27 16:21:51,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:51,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:51,646 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 16:21:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:51,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 16:21:51,660 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 16:21:51,661 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-06-27 16:21:51,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-06-27 16:21:51,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-06-27 16:21:51,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-06-27 16:21:51,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 16:21:51,663 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-06-27 16:21:51,663 WARN L234 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-27 16:21:51,664 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-06-27 16:21:51,677 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 16:21:51,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 25 transitions, 68 flow [2024-06-27 16:21:51,690 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2024-06-27 16:21:51,693 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-06-27 16:21:51,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 31 events. 0/31 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 67 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2024-06-27 16:21:51,694 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 25 transitions, 68 flow [2024-06-27 16:21:51,694 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 25 transitions, 68 flow [2024-06-27 16:21:51,696 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:21:51,698 INFO L357 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, mHoare=true, 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;@7a6ddc0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:21:51,699 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-06-27 16:21:51,703 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:21:51,703 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-06-27 16:21:51,706 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-06-27 16:21:51,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:51,706 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 16:21:51,707 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 16:21:51,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:51,707 INFO L85 PathProgramCache]: Analyzing trace with hash 142336013, now seen corresponding path program 1 times [2024-06-27 16:21:51,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:51,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341402721] [2024-06-27 16:21:51,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:51,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:21:51,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:21:51,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:21:51,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341402721] [2024-06-27 16:21:51,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341402721] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:21:51,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:21:51,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 16:21:51,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301007112] [2024-06-27 16:21:51,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:21:51,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:21:51,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:21:51,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:21:51,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:21:51,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2024-06-27 16:21:51,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-06-27 16:21:51,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:21:51,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2024-06-27 16:21:51,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:21:51,955 INFO L124 PetriNetUnfolderBase]: 447/731 cut-off events. [2024-06-27 16:21:51,955 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2024-06-27 16:21:51,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1539 conditions, 731 events. 447/731 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3393 event pairs, 161 based on Foata normal form. 0/613 useless extension candidates. Maximal degree in co-relation 464. Up to 653 conditions per place. [2024-06-27 16:21:51,964 INFO L140 encePairwiseOnDemand]: 17/25 looper letters, 22 selfloop transitions, 4 changer transitions 0/33 dead transitions. [2024-06-27 16:21:51,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 148 flow [2024-06-27 16:21:51,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:21:51,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:21:51,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2024-06-27 16:21:51,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6933333333333334 [2024-06-27 16:21:51,966 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 68 flow. Second operand 3 states and 52 transitions. [2024-06-27 16:21:51,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 148 flow [2024-06-27 16:21:51,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 144 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-27 16:21:51,968 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 94 flow [2024-06-27 16:21:51,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2024-06-27 16:21:51,969 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2024-06-27 16:21:51,969 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 94 flow [2024-06-27 16:21:51,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-06-27 16:21:51,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:51,969 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1] [2024-06-27 16:21:51,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 16:21:51,970 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 16:21:51,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:51,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1713846672, now seen corresponding path program 1 times [2024-06-27 16:21:51,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:51,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209815392] [2024-06-27 16:21:51,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:51,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:51,993 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 16:21:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:51,999 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 16:21:51,999 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 16:21:52,000 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-06-27 16:21:52,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-06-27 16:21:52,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-06-27 16:21:52,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-06-27 16:21:52,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-06-27 16:21:52,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 16:21:52,004 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-06-27 16:21:52,005 WARN L234 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-27 16:21:52,005 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-06-27 16:21:52,020 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 16:21:52,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 92 flow [2024-06-27 16:21:52,025 INFO L124 PetriNetUnfolderBase]: 0/40 cut-off events. [2024-06-27 16:21:52,026 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-06-27 16:21:52,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 40 events. 0/40 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 88 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2024-06-27 16:21:52,026 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 32 transitions, 92 flow [2024-06-27 16:21:52,028 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 32 transitions, 92 flow [2024-06-27 16:21:52,029 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:21:52,030 INFO L357 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, mHoare=true, 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;@7a6ddc0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:21:52,030 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-27 16:21:52,033 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:21:52,033 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-27 16:21:52,033 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-06-27 16:21:52,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:52,033 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 16:21:52,033 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-06-27 16:21:52,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:52,034 INFO L85 PathProgramCache]: Analyzing trace with hash 172879731, now seen corresponding path program 1 times [2024-06-27 16:21:52,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:52,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660995550] [2024-06-27 16:21:52,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:52,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:21:52,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:21:52,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:21:52,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660995550] [2024-06-27 16:21:52,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660995550] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:21:52,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:21:52,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 16:21:52,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689039870] [2024-06-27 16:21:52,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:21:52,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:21:52,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:21:52,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:21:52,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:21:52,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-27 16:21:52,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-06-27 16:21:52,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:21:52,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-27 16:21:52,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:21:52,482 INFO L124 PetriNetUnfolderBase]: 3473/4901 cut-off events. [2024-06-27 16:21:52,482 INFO L125 PetriNetUnfolderBase]: For 1240/1240 co-relation queries the response was YES. [2024-06-27 16:21:52,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10386 conditions, 4901 events. 3473/4901 cut-off events. For 1240/1240 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 25231 event pairs, 1433 based on Foata normal form. 0/3983 useless extension candidates. Maximal degree in co-relation 1769. Up to 4711 conditions per place. [2024-06-27 16:21:52,522 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 29 selfloop transitions, 5 changer transitions 0/43 dead transitions. [2024-06-27 16:21:52,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 43 transitions, 203 flow [2024-06-27 16:21:52,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:21:52,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:21:52,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2024-06-27 16:21:52,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6979166666666666 [2024-06-27 16:21:52,528 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 92 flow. Second operand 3 states and 67 transitions. [2024-06-27 16:21:52,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 43 transitions, 203 flow [2024-06-27 16:21:52,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 191 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-06-27 16:21:52,531 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 123 flow [2024-06-27 16:21:52,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2024-06-27 16:21:52,534 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2024-06-27 16:21:52,534 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 123 flow [2024-06-27 16:21:52,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-06-27 16:21:52,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:52,534 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2024-06-27 16:21:52,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 16:21:52,537 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-06-27 16:21:52,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:52,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1111353817, now seen corresponding path program 1 times [2024-06-27 16:21:52,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:52,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391116068] [2024-06-27 16:21:52,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:52,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:52,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 16:21:52,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:52,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 16:21:52,577 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 16:21:52,577 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-06-27 16:21:52,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-06-27 16:21:52,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2024-06-27 16:21:52,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-06-27 16:21:52,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-06-27 16:21:52,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-06-27 16:21:52,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 16:21:52,578 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-06-27 16:21:52,578 WARN L234 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-27 16:21:52,578 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-06-27 16:21:52,596 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 16:21:52,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 39 transitions, 118 flow [2024-06-27 16:21:52,600 INFO L124 PetriNetUnfolderBase]: 0/49 cut-off events. [2024-06-27 16:21:52,600 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-06-27 16:21:52,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 49 events. 0/49 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 122 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2024-06-27 16:21:52,601 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 39 transitions, 118 flow [2024-06-27 16:21:52,601 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 39 transitions, 118 flow [2024-06-27 16:21:52,629 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:21:52,629 INFO L357 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, mHoare=true, 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;@7a6ddc0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:21:52,629 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-27 16:21:52,631 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:21:52,631 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-06-27 16:21:52,631 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-06-27 16:21:52,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:52,631 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 16:21:52,631 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-06-27 16:21:52,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:52,632 INFO L85 PathProgramCache]: Analyzing trace with hash 210103200, now seen corresponding path program 1 times [2024-06-27 16:21:52,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:52,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4883282] [2024-06-27 16:21:52,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:52,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:21:52,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:21:52,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:21:52,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4883282] [2024-06-27 16:21:52,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4883282] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:21:52,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:21:52,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 16:21:52,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668665195] [2024-06-27 16:21:52,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:21:52,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:21:52,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:21:52,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:21:52,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:21:52,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-06-27 16:21:52,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-06-27 16:21:52,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:21:52,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-06-27 16:21:52,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:21:54,583 INFO L124 PetriNetUnfolderBase]: 24009/31313 cut-off events. [2024-06-27 16:21:54,584 INFO L125 PetriNetUnfolderBase]: For 9784/9784 co-relation queries the response was YES. [2024-06-27 16:21:54,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66523 conditions, 31313 events. 24009/31313 cut-off events. For 9784/9784 co-relation queries the response was YES. Maximal size of possible extension queue 1441. Compared 169904 event pairs, 11031 based on Foata normal form. 0/24923 useless extension candidates. Maximal degree in co-relation 10509. Up to 30867 conditions per place. [2024-06-27 16:21:54,786 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 36 selfloop transitions, 6 changer transitions 0/53 dead transitions. [2024-06-27 16:21:54,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 53 transitions, 262 flow [2024-06-27 16:21:54,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:21:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:21:54,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2024-06-27 16:21:54,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7008547008547008 [2024-06-27 16:21:54,790 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 118 flow. Second operand 3 states and 82 transitions. [2024-06-27 16:21:54,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 53 transitions, 262 flow [2024-06-27 16:21:54,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 53 transitions, 238 flow, removed 12 selfloop flow, removed 0 redundant places. [2024-06-27 16:21:54,798 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 152 flow [2024-06-27 16:21:54,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2024-06-27 16:21:54,799 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2024-06-27 16:21:54,799 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 152 flow [2024-06-27 16:21:54,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-06-27 16:21:54,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:54,799 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:21:54,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 16:21:54,800 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-06-27 16:21:54,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:54,800 INFO L85 PathProgramCache]: Analyzing trace with hash -594261696, now seen corresponding path program 1 times [2024-06-27 16:21:54,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:54,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093904741] [2024-06-27 16:21:54,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:54,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:21:54,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:21:54,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:21:54,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093904741] [2024-06-27 16:21:54,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093904741] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:21:54,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:21:54,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:21:54,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315612076] [2024-06-27 16:21:54,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:21:54,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:21:54,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:21:54,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:21:54,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:21:54,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-06-27 16:21:54,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-06-27 16:21:54,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:21:54,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-06-27 16:21:54,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:21:56,034 INFO L124 PetriNetUnfolderBase]: 13439/19846 cut-off events. [2024-06-27 16:21:56,035 INFO L125 PetriNetUnfolderBase]: For 7894/7894 co-relation queries the response was YES. [2024-06-27 16:21:56,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41509 conditions, 19846 events. 13439/19846 cut-off events. For 7894/7894 co-relation queries the response was YES. Maximal size of possible extension queue 1000. Compared 135189 event pairs, 5255 based on Foata normal form. 5668/24391 useless extension candidates. Maximal degree in co-relation 32130. Up to 15240 conditions per place. [2024-06-27 16:21:56,358 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 32 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2024-06-27 16:21:56,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 53 transitions, 256 flow [2024-06-27 16:21:56,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:21:56,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:21:56,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-06-27 16:21:56,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6410256410256411 [2024-06-27 16:21:56,362 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 152 flow. Second operand 3 states and 75 transitions. [2024-06-27 16:21:56,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 53 transitions, 256 flow [2024-06-27 16:21:56,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 53 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:21:56,366 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 161 flow [2024-06-27 16:21:56,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=161, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2024-06-27 16:21:56,367 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2024-06-27 16:21:56,367 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 161 flow [2024-06-27 16:21:56,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-06-27 16:21:56,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:56,368 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:21:56,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 16:21:56,369 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-06-27 16:21:56,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:56,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1343851726, now seen corresponding path program 1 times [2024-06-27 16:21:56,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:56,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002773602] [2024-06-27 16:21:56,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:56,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:56,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 16:21:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:56,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 16:21:56,396 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 16:21:56,396 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-06-27 16:21:56,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-06-27 16:21:56,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2024-06-27 16:21:56,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2024-06-27 16:21:56,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2024-06-27 16:21:56,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2024-06-27 16:21:56,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-06-27 16:21:56,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 16:21:56,397 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-06-27 16:21:56,398 WARN L234 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-27 16:21:56,398 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-06-27 16:21:56,420 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 16:21:56,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 46 transitions, 146 flow [2024-06-27 16:21:56,428 INFO L124 PetriNetUnfolderBase]: 0/58 cut-off events. [2024-06-27 16:21:56,428 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2024-06-27 16:21:56,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 58 events. 0/58 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 146 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2024-06-27 16:21:56,428 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 46 transitions, 146 flow [2024-06-27 16:21:56,429 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 46 transitions, 146 flow [2024-06-27 16:21:56,431 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:21:56,432 INFO L357 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, mHoare=true, 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;@7a6ddc0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:21:56,432 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-27 16:21:56,434 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:21:56,434 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-27 16:21:56,436 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-06-27 16:21:56,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:56,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 16:21:56,437 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 16:21:56,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:56,437 INFO L85 PathProgramCache]: Analyzing trace with hash 254006996, now seen corresponding path program 1 times [2024-06-27 16:21:56,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:56,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91654554] [2024-06-27 16:21:56,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:56,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:21:56,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:21:56,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:21:56,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91654554] [2024-06-27 16:21:56,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91654554] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:21:56,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:21:56,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 16:21:56,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022675040] [2024-06-27 16:21:56,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:21:56,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:21:56,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:21:56,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:21:56,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:21:56,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 16:21:56,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-06-27 16:21:56,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:21:56,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 16:21:56,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:22:06,494 INFO L124 PetriNetUnfolderBase]: 153983/191303 cut-off events. [2024-06-27 16:22:06,494 INFO L125 PetriNetUnfolderBase]: For 71426/71426 co-relation queries the response was YES. [2024-06-27 16:22:06,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406806 conditions, 191303 events. 153983/191303 cut-off events. For 71426/71426 co-relation queries the response was YES. Maximal size of possible extension queue 6618. Compared 1069239 event pairs, 76663 based on Foata normal form. 0/150265 useless extension candidates. Maximal degree in co-relation 67205. Up to 190281 conditions per place. [2024-06-27 16:22:08,050 INFO L140 encePairwiseOnDemand]: 32/46 looper letters, 43 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2024-06-27 16:22:08,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 63 transitions, 325 flow [2024-06-27 16:22:08,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:22:08,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:22:08,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-06-27 16:22:08,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7028985507246377 [2024-06-27 16:22:08,052 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 146 flow. Second operand 3 states and 97 transitions. [2024-06-27 16:22:08,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 63 transitions, 325 flow [2024-06-27 16:22:08,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 63 transitions, 285 flow, removed 20 selfloop flow, removed 0 redundant places. [2024-06-27 16:22:08,066 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 181 flow [2024-06-27 16:22:08,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2024-06-27 16:22:08,066 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 2 predicate places. [2024-06-27 16:22:08,067 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 181 flow [2024-06-27 16:22:08,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-06-27 16:22:08,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:22:08,067 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:22:08,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 16:22:08,067 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 16:22:08,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:22:08,068 INFO L85 PathProgramCache]: Analyzing trace with hash 192769982, now seen corresponding path program 1 times [2024-06-27 16:22:08,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:22:08,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662979212] [2024-06-27 16:22:08,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:22:08,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:22:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:22:08,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:22:08,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:22:08,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662979212] [2024-06-27 16:22:08,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662979212] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:22:08,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:22:08,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:22:08,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939977867] [2024-06-27 16:22:08,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:22:08,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:22:08,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:22:08,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:22:08,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:22:08,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 16:22:08,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-06-27 16:22:08,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:22:08,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 16:22:08,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:22:14,208 INFO L124 PetriNetUnfolderBase]: 78146/108409 cut-off events. [2024-06-27 16:22:14,209 INFO L125 PetriNetUnfolderBase]: For 48322/48322 co-relation queries the response was YES. [2024-06-27 16:22:14,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224306 conditions, 108409 events. 78146/108409 cut-off events. For 48322/48322 co-relation queries the response was YES. Maximal size of possible extension queue 4489. Compared 791009 event pairs, 35211 based on Foata normal form. 34312/134944 useless extension candidates. Maximal degree in co-relation 175157. Up to 83683 conditions per place. [2024-06-27 16:22:15,324 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 38 selfloop transitions, 6 changer transitions 0/63 dead transitions. [2024-06-27 16:22:15,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 63 transitions, 306 flow [2024-06-27 16:22:15,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:22:15,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:22:15,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2024-06-27 16:22:15,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.644927536231884 [2024-06-27 16:22:15,325 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 181 flow. Second operand 3 states and 89 transitions. [2024-06-27 16:22:15,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 63 transitions, 306 flow [2024-06-27 16:22:15,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 63 transitions, 299 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:22:15,337 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 192 flow [2024-06-27 16:22:15,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2024-06-27 16:22:15,337 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -2 predicate places. [2024-06-27 16:22:15,337 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 192 flow [2024-06-27 16:22:15,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-06-27 16:22:15,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:22:15,338 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:22:15,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 16:22:15,338 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 16:22:15,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:22:15,338 INFO L85 PathProgramCache]: Analyzing trace with hash -601905615, now seen corresponding path program 1 times [2024-06-27 16:22:15,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:22:15,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502684591] [2024-06-27 16:22:15,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:22:15,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:22:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:22:15,346 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 16:22:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:22:15,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 16:22:15,353 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 16:22:15,353 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2024-06-27 16:22:15,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2024-06-27 16:22:15,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2024-06-27 16:22:15,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2024-06-27 16:22:15,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2024-06-27 16:22:15,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2024-06-27 16:22:15,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2024-06-27 16:22:15,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2024-06-27 16:22:15,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 16:22:15,354 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-06-27 16:22:15,355 WARN L234 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-27 16:22:15,355 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2024-06-27 16:22:15,370 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 16:22:15,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 53 transitions, 176 flow [2024-06-27 16:22:15,374 INFO L124 PetriNetUnfolderBase]: 0/67 cut-off events. [2024-06-27 16:22:15,374 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2024-06-27 16:22:15,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 67 events. 0/67 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 184 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2024-06-27 16:22:15,375 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 53 transitions, 176 flow [2024-06-27 16:22:15,375 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 53 transitions, 176 flow [2024-06-27 16:22:15,376 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:22:15,376 INFO L357 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, mHoare=true, 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;@7a6ddc0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:22:15,376 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-27 16:22:15,377 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:22:15,377 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-27 16:22:15,377 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-06-27 16:22:15,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:22:15,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 16:22:15,378 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2024-06-27 16:22:15,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:22:15,378 INFO L85 PathProgramCache]: Analyzing trace with hash 304591503, now seen corresponding path program 1 times [2024-06-27 16:22:15,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:22:15,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578139454] [2024-06-27 16:22:15,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:22:15,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:22:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:22:15,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:22:15,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:22:15,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578139454] [2024-06-27 16:22:15,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578139454] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:22:15,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:22:15,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 16:22:15,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598148428] [2024-06-27 16:22:15,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:22:15,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:22:15,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:22:15,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:22:15,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:22:15,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 53 [2024-06-27 16:22:15,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 53 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-06-27 16:22:15,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:22:15,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 53 [2024-06-27 16:22:15,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand