./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/45_monabsex1_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/45_monabsex1_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 43a7b886f1e454dafac7facab2674c64a0fa591a6bf106acb1f8b320d6c92508 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 16:21:46,875 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 16:21:46,911 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:46,915 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 16:21:46,915 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 16:21:46,933 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 16:21:46,933 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 16:21:46,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 16:21:46,948 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 16:21:46,949 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 16:21:46,949 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 16:21:46,949 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 16:21:46,950 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 16:21:46,950 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 16:21:46,950 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 16:21:46,950 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 16:21:46,951 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 16:21:46,951 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 16:21:46,951 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 16:21:46,951 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 16:21:46,952 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 16:21:46,952 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 16:21:46,952 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 16:21:46,953 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 16:21:46,953 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 16:21:46,953 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 16:21:46,953 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 16:21:46,953 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 16:21:46,954 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 16:21:46,954 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 16:21:46,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 16:21:46,955 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 16:21:46,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:21:46,956 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 16:21:46,956 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 16:21:46,956 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 16:21:46,956 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 16:21:46,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 16:21:46,956 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 16:21:46,957 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 16:21:46,957 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 16:21:46,957 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 16:21:46,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 16:21:46,957 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 -> 43a7b886f1e454dafac7facab2674c64a0fa591a6bf106acb1f8b320d6c92508 [2024-06-27 16:21:47,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 16:21:47,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 16:21:47,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 16:21:47,235 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 16:21:47,235 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 16:21:47,236 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i [2024-06-27 16:21:48,296 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 16:21:48,516 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 16:21:48,517 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i [2024-06-27 16:21:48,532 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58acaff99/c074bc98e0ea4b50b9dfa7f960a8dd26/FLAG116b35283 [2024-06-27 16:21:48,874 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58acaff99/c074bc98e0ea4b50b9dfa7f960a8dd26 [2024-06-27 16:21:48,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 16:21:48,877 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 16:21:48,878 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 16:21:48,878 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 16:21:48,882 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 16:21:48,883 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:21:48" (1/1) ... [2024-06-27 16:21:48,883 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@183aa6a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:48, skipping insertion in model container [2024-06-27 16:21:48,884 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:21:48" (1/1) ... [2024-06-27 16:21:48,930 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 16:21:49,177 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/45_monabsex1_vs.i[30633,30646] [2024-06-27 16:21:49,194 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:21:49,200 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 16:21:49,245 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/45_monabsex1_vs.i[30633,30646] [2024-06-27 16:21:49,247 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:21:49,279 INFO L206 MainTranslator]: Completed translation [2024-06-27 16:21:49,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:49 WrapperNode [2024-06-27 16:21:49,280 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 16:21:49,281 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 16:21:49,281 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 16:21:49,281 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 16:21:49,286 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:49" (1/1) ... [2024-06-27 16:21:49,304 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:49" (1/1) ... [2024-06-27 16:21:49,321 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 22 [2024-06-27 16:21:49,321 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 16:21:49,321 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 16:21:49,322 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 16:21:49,322 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 16:21:49,329 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:49" (1/1) ... [2024-06-27 16:21:49,329 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:49" (1/1) ... [2024-06-27 16:21:49,337 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:49" (1/1) ... [2024-06-27 16:21:49,350 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:49,351 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:49" (1/1) ... [2024-06-27 16:21:49,351 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:49" (1/1) ... [2024-06-27 16:21:49,359 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:49" (1/1) ... [2024-06-27 16:21:49,363 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:49" (1/1) ... [2024-06-27 16:21:49,367 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:49" (1/1) ... [2024-06-27 16:21:49,368 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:49" (1/1) ... [2024-06-27 16:21:49,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 16:21:49,373 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 16:21:49,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 16:21:49,373 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 16:21:49,374 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:49" (1/1) ... [2024-06-27 16:21:49,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:21:49,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:21:49,416 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:49,433 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:49,457 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-06-27 16:21:49,457 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-06-27 16:21:49,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 16:21:49,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 16:21:49,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 16:21:49,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 16:21:49,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 16:21:49,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 16:21:49,461 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:49,563 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 16:21:49,564 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 16:21:49,636 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 16:21:49,636 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 16:21:49,697 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 16:21:49,698 INFO L320 CfgBuilder]: Removed 1 assume(true) statements. [2024-06-27 16:21:49,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:21:49 BoogieIcfgContainer [2024-06-27 16:21:49,698 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 16:21:49,699 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 16:21:49,700 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 16:21:49,702 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 16:21:49,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 04:21:48" (1/3) ... [2024-06-27 16:21:49,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b91f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:21:49, skipping insertion in model container [2024-06-27 16:21:49,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:49" (2/3) ... [2024-06-27 16:21:49,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b91f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:21:49, skipping insertion in model container [2024-06-27 16:21:49,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:21:49" (3/3) ... [2024-06-27 16:21:49,704 INFO L112 eAbstractionObserver]: Analyzing ICFG 45_monabsex1_vs.i [2024-06-27 16:21:49,710 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 16:21:49,717 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 16:21:49,717 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 16:21:49,717 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 16:21:49,740 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 16:21:49,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 13 places, 10 transitions, 24 flow [2024-06-27 16:21:49,777 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2024-06-27 16:21:49,777 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 16:21:49,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16 conditions, 12 events. 0/12 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/9 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-06-27 16:21:49,779 INFO L82 GeneralOperation]: Start removeDead. Operand has 13 places, 10 transitions, 24 flow [2024-06-27 16:21:49,781 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 13 places, 10 transitions, 24 flow [2024-06-27 16:21:49,788 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:21:49,793 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;@6b4f12c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:21:49,794 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-06-27 16:21:49,797 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:21:49,797 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-27 16:21:49,797 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 16:21:49,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:49,798 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-06-27 16:21:49,798 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:49,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:49,803 INFO L85 PathProgramCache]: Analyzing trace with hash 116525258, now seen corresponding path program 1 times [2024-06-27 16:21:49,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:49,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129954735] [2024-06-27 16:21:49,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:49,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:49,901 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 16:21:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:49,941 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 16:21:49,943 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 16:21:49,944 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-06-27 16:21:49,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-06-27 16:21:49,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-06-27 16:21:49,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 16:21:49,946 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-06-27 16:21:49,951 WARN L234 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-27 16:21:49,951 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-06-27 16:21:49,980 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 16:21:49,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 16 transitions, 42 flow [2024-06-27 16:21:49,986 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2024-06-27 16:21:49,993 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 16:21:49,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 20 events. 0/20 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 33 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2024-06-27 16:21:49,993 INFO L82 GeneralOperation]: Start removeDead. Operand has 21 places, 16 transitions, 42 flow [2024-06-27 16:21:49,993 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 16 transitions, 42 flow [2024-06-27 16:21:49,995 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:21:49,996 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;@6b4f12c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:21:49,996 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-27 16:21:50,000 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:21:50,002 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2024-06-27 16:21:50,002 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 16:21:50,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:50,002 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-27 16:21:50,002 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:50,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:50,003 INFO L85 PathProgramCache]: Analyzing trace with hash -209193185, now seen corresponding path program 1 times [2024-06-27 16:21:50,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:50,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187242242] [2024-06-27 16:21:50,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:50,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:21:50,163 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:50,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:21:50,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187242242] [2024-06-27 16:21:50,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187242242] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:21:50,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:21:50,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:21:50,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698455987] [2024-06-27 16:21:50,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:21:50,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:21:50,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:21:50,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:21:50,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:21:50,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2024-06-27 16:21:50,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 16 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:50,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:21:50,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2024-06-27 16:21:50,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:21:50,310 INFO L124 PetriNetUnfolderBase]: 109/215 cut-off events. [2024-06-27 16:21:50,310 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-06-27 16:21:50,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 215 events. 109/215 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 797 event pairs, 45 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 328. Up to 116 conditions per place. [2024-06-27 16:21:50,316 INFO L140 encePairwiseOnDemand]: 11/16 looper letters, 20 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2024-06-27 16:21:50,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 24 transitions, 109 flow [2024-06-27 16:21:50,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:21:50,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:21:50,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2024-06-27 16:21:50,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2024-06-27 16:21:50,327 INFO L175 Difference]: Start difference. First operand has 21 places, 16 transitions, 42 flow. Second operand 3 states and 29 transitions. [2024-06-27 16:21:50,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 24 transitions, 109 flow [2024-06-27 16:21:50,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 24 transitions, 109 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 16:21:50,332 INFO L231 Difference]: Finished difference. Result has 24 places, 17 transitions, 62 flow [2024-06-27 16:21:50,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=24, PETRI_TRANSITIONS=17} [2024-06-27 16:21:50,336 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2024-06-27 16:21:50,336 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 62 flow [2024-06-27 16:21:50,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:50,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:50,337 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1] [2024-06-27 16:21:50,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 16:21:50,338 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:50,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:50,338 INFO L85 PathProgramCache]: Analyzing trace with hash 2104742930, now seen corresponding path program 1 times [2024-06-27 16:21:50,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:50,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781719228] [2024-06-27 16:21:50,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:50,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:50,368 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 16:21:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:50,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 16:21:50,383 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 16:21:50,385 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-06-27 16:21:50,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-06-27 16:21:50,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-06-27 16:21:50,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-06-27 16:21:50,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 16:21:50,387 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-06-27 16:21:50,388 WARN L234 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-27 16:21:50,388 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-06-27 16:21:50,409 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 16:21:50,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 22 transitions, 62 flow [2024-06-27 16:21:50,416 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-06-27 16:21:50,418 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-06-27 16:21:50,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 0/28 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 60 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2024-06-27 16:21:50,419 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 22 transitions, 62 flow [2024-06-27 16:21:50,420 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 62 flow [2024-06-27 16:21:50,421 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:21:50,422 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;@6b4f12c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:21:50,422 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-06-27 16:21:50,425 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:21:50,425 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2024-06-27 16:21:50,429 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-27 16:21:50,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:50,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-27 16:21:50,430 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:50,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:50,430 INFO L85 PathProgramCache]: Analyzing trace with hash 441791802, now seen corresponding path program 1 times [2024-06-27 16:21:50,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:50,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644164547] [2024-06-27 16:21:50,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:50,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:21:50,476 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:50,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:21:50,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644164547] [2024-06-27 16:21:50,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644164547] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:21:50,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:21:50,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:21:50,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186385112] [2024-06-27 16:21:50,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:21:50,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:21:50,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:21:50,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:21:50,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:21:50,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2024-06-27 16:21:50,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:50,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:21:50,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2024-06-27 16:21:50,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:21:50,694 INFO L124 PetriNetUnfolderBase]: 1343/2070 cut-off events. [2024-06-27 16:21:50,694 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2024-06-27 16:21:50,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4339 conditions, 2070 events. 1343/2070 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10043 event pairs, 681 based on Foata normal form. 0/1764 useless extension candidates. Maximal degree in co-relation 2280. Up to 1272 conditions per place. [2024-06-27 16:21:50,715 INFO L140 encePairwiseOnDemand]: 16/22 looper letters, 31 selfloop transitions, 4 changer transitions 0/36 dead transitions. [2024-06-27 16:21:50,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 36 transitions, 172 flow [2024-06-27 16:21:50,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:21:50,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:21:50,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2024-06-27 16:21:50,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2024-06-27 16:21:50,718 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 62 flow. Second operand 3 states and 41 transitions. [2024-06-27 16:21:50,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 36 transitions, 172 flow [2024-06-27 16:21:50,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 36 transitions, 168 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-27 16:21:50,722 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 88 flow [2024-06-27 16:21:50,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2024-06-27 16:21:50,723 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2024-06-27 16:21:50,723 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 88 flow [2024-06-27 16:21:50,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:50,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:50,724 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-06-27 16:21:50,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 16:21:50,724 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 16:21:50,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:50,725 INFO L85 PathProgramCache]: Analyzing trace with hash -645969972, now seen corresponding path program 1 times [2024-06-27 16:21:50,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:50,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816130817] [2024-06-27 16:21:50,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:50,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:21:50,759 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:21:50,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:21:50,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816130817] [2024-06-27 16:21:50,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816130817] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:21:50,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:21:50,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:21:50,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763398799] [2024-06-27 16:21:50,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:21:50,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:21:50,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:21:50,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:21:50,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:21:50,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2024-06-27 16:21:50,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:50,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:21:50,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2024-06-27 16:21:50,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:21:50,966 INFO L124 PetriNetUnfolderBase]: 1689/2637 cut-off events. [2024-06-27 16:21:50,967 INFO L125 PetriNetUnfolderBase]: For 1047/1047 co-relation queries the response was YES. [2024-06-27 16:21:50,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6318 conditions, 2637 events. 1689/2637 cut-off events. For 1047/1047 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 13552 event pairs, 787 based on Foata normal form. 0/2387 useless extension candidates. Maximal degree in co-relation 5575. Up to 1546 conditions per place. [2024-06-27 16:21:50,985 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 33 selfloop transitions, 6 changer transitions 0/40 dead transitions. [2024-06-27 16:21:50,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 221 flow [2024-06-27 16:21:50,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:21:50,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:21:50,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2024-06-27 16:21:50,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2024-06-27 16:21:50,987 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 88 flow. Second operand 3 states and 38 transitions. [2024-06-27 16:21:50,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 221 flow [2024-06-27 16:21:50,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 40 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 16:21:50,994 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 128 flow [2024-06-27 16:21:50,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2024-06-27 16:21:50,995 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2024-06-27 16:21:50,995 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 128 flow [2024-06-27 16:21:50,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:50,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:50,996 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1] [2024-06-27 16:21:50,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 16:21:50,996 INFO L420 AbstractCegarLoop]: === Iteration 3 === 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:50,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:50,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1449416299, now seen corresponding path program 1 times [2024-06-27 16:21:50,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:50,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560928942] [2024-06-27 16:21:50,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:50,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:51,008 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 16:21:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:51,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 16:21:51,018 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 16:21:51,018 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-06-27 16:21:51,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-06-27 16:21:51,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-06-27 16:21:51,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-06-27 16:21:51,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-06-27 16:21:51,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 16:21:51,019 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-06-27 16:21:51,020 WARN L234 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-27 16:21:51,020 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-06-27 16:21:51,037 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 16:21:51,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 28 transitions, 84 flow [2024-06-27 16:21:51,042 INFO L124 PetriNetUnfolderBase]: 0/36 cut-off events. [2024-06-27 16:21:51,042 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-06-27 16:21:51,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 36 events. 0/36 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 75 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2024-06-27 16:21:51,042 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 28 transitions, 84 flow [2024-06-27 16:21:51,043 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 28 transitions, 84 flow [2024-06-27 16:21:51,044 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:21:51,044 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;@6b4f12c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:21:51,045 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-27 16:21:51,046 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:21:51,046 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-06-27 16:21:51,047 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-06-27 16:21:51,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:51,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-27 16:21:51,047 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:51,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:51,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1270282490, now seen corresponding path program 1 times [2024-06-27 16:21:51,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:51,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616601752] [2024-06-27 16:21:51,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:51,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:21:51,065 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,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:21:51,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616601752] [2024-06-27 16:21:51,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616601752] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:21:51,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:21:51,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:21:51,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622962045] [2024-06-27 16:21:51,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:21:51,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:21:51,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:21:51,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:21:51,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:21:51,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2024-06-27 16:21:51,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:21:51,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2024-06-27 16:21:51,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:21:51,991 INFO L124 PetriNetUnfolderBase]: 12243/16840 cut-off events. [2024-06-27 16:21:51,992 INFO L125 PetriNetUnfolderBase]: For 3653/3653 co-relation queries the response was YES. [2024-06-27 16:21:52,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35374 conditions, 16840 events. 12243/16840 cut-off events. For 3653/3653 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 90164 event pairs, 6745 based on Foata normal form. 0/14174 useless extension candidates. Maximal degree in co-relation 5360. Up to 10936 conditions per place. [2024-06-27 16:21:52,101 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 42 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2024-06-27 16:21:52,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 48 transitions, 239 flow [2024-06-27 16:21:52,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:21:52,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:21:52,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2024-06-27 16:21:52,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2024-06-27 16:21:52,103 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 84 flow. Second operand 3 states and 53 transitions. [2024-06-27 16:21:52,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 48 transitions, 239 flow [2024-06-27 16:21:52,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 48 transitions, 227 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-06-27 16:21:52,106 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 114 flow [2024-06-27 16:21:52,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2024-06-27 16:21:52,107 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2024-06-27 16:21:52,107 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 114 flow [2024-06-27 16:21:52,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:52,108 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-06-27 16:21:52,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 16:21:52,108 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-06-27 16:21:52,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:52,109 INFO L85 PathProgramCache]: Analyzing trace with hash 960014887, now seen corresponding path program 1 times [2024-06-27 16:21:52,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:52,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305760438] [2024-06-27 16:21:52,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:52,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:52,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:21:52,127 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:21:52,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:21:52,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305760438] [2024-06-27 16:21:52,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305760438] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:21:52,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:21:52,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:21:52,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559990251] [2024-06-27 16:21:52,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:21:52,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:21:52,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:21:52,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:21:52,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:21:52,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2024-06-27 16:21:52,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:21:52,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2024-06-27 16:21:52,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:21:53,496 INFO L124 PetriNetUnfolderBase]: 16953/23450 cut-off events. [2024-06-27 16:21:53,497 INFO L125 PetriNetUnfolderBase]: For 9851/9851 co-relation queries the response was YES. [2024-06-27 16:21:53,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55876 conditions, 23450 events. 16953/23450 cut-off events. For 9851/9851 co-relation queries the response was YES. Maximal size of possible extension queue 963. Compared 133484 event pairs, 8455 based on Foata normal form. 0/20680 useless extension candidates. Maximal degree in co-relation 49761. Up to 15062 conditions per place. [2024-06-27 16:21:53,633 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 45 selfloop transitions, 8 changer transitions 0/54 dead transitions. [2024-06-27 16:21:53,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 54 transitions, 300 flow [2024-06-27 16:21:53,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:21:53,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:21:53,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2024-06-27 16:21:53,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2024-06-27 16:21:53,635 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 114 flow. Second operand 3 states and 50 transitions. [2024-06-27 16:21:53,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 54 transitions, 300 flow [2024-06-27 16:21:53,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 54 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 16:21:53,704 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 172 flow [2024-06-27 16:21:53,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2024-06-27 16:21:53,705 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2024-06-27 16:21:53,705 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 172 flow [2024-06-27 16:21:53,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:53,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:53,705 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:21:53,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 16:21:53,706 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-06-27 16:21:53,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:53,706 INFO L85 PathProgramCache]: Analyzing trace with hash -859164641, now seen corresponding path program 1 times [2024-06-27 16:21:53,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:53,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998438434] [2024-06-27 16:21:53,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:53,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:21:53,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-06-27 16:21:53,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:21:53,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998438434] [2024-06-27 16:21:53,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998438434] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:21:53,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:21:53,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:21:53,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429687071] [2024-06-27 16:21:53,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:21:53,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:21:53,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:21:53,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:21:53,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:21:53,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2024-06-27 16:21:53,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:53,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:21:53,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2024-06-27 16:21:53,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:21:55,477 INFO L124 PetriNetUnfolderBase]: 22305/31049 cut-off events. [2024-06-27 16:21:55,478 INFO L125 PetriNetUnfolderBase]: For 20707/20707 co-relation queries the response was YES. [2024-06-27 16:21:55,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79820 conditions, 31049 events. 22305/31049 cut-off events. For 20707/20707 co-relation queries the response was YES. Maximal size of possible extension queue 1318. Compared 185209 event pairs, 10801 based on Foata normal form. 0/27827 useless extension candidates. Maximal degree in co-relation 71245. Up to 19502 conditions per place. [2024-06-27 16:21:55,724 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 49 selfloop transitions, 13 changer transitions 0/63 dead transitions. [2024-06-27 16:21:55,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 63 transitions, 409 flow [2024-06-27 16:21:55,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:21:55,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:21:55,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2024-06-27 16:21:55,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-06-27 16:21:55,728 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 172 flow. Second operand 3 states and 49 transitions. [2024-06-27 16:21:55,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 63 transitions, 409 flow [2024-06-27 16:21:55,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 63 transitions, 381 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 16:21:55,793 INFO L231 Difference]: Finished difference. Result has 44 places, 46 transitions, 278 flow [2024-06-27 16:21:55,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=44, PETRI_TRANSITIONS=46} [2024-06-27 16:21:55,794 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 7 predicate places. [2024-06-27 16:21:55,795 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 46 transitions, 278 flow [2024-06-27 16:21:55,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:55,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:55,795 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:21:55,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 16:21:55,796 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-06-27 16:21:55,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:55,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1180892551, now seen corresponding path program 1 times [2024-06-27 16:21:55,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:55,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964447885] [2024-06-27 16:21:55,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:55,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:55,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:21:55,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:21:55,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:21:55,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964447885] [2024-06-27 16:21:55,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964447885] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:21:55,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:21:55,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:21:55,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116175373] [2024-06-27 16:21:55,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:21:55,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 16:21:55,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:21:55,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 16:21:55,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 16:21:55,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2024-06-27 16:21:55,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 46 transitions, 278 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:55,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:21:55,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2024-06-27 16:21:55,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:21:58,938 INFO L124 PetriNetUnfolderBase]: 38199/53543 cut-off events. [2024-06-27 16:21:58,939 INFO L125 PetriNetUnfolderBase]: For 51743/51743 co-relation queries the response was YES. [2024-06-27 16:21:59,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150159 conditions, 53543 events. 38199/53543 cut-off events. For 51743/51743 co-relation queries the response was YES. Maximal size of possible extension queue 2350. Compared 356824 event pairs, 6385 based on Foata normal form. 0/48341 useless extension candidates. Maximal degree in co-relation 150074. Up to 16776 conditions per place. [2024-06-27 16:21:59,256 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 113 selfloop transitions, 33 changer transitions 0/147 dead transitions. [2024-06-27 16:21:59,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 147 transitions, 1084 flow [2024-06-27 16:21:59,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 16:21:59,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 16:21:59,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-06-27 16:21:59,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2024-06-27 16:21:59,258 INFO L175 Difference]: Start difference. First operand has 44 places, 46 transitions, 278 flow. Second operand 6 states and 114 transitions. [2024-06-27 16:21:59,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 147 transitions, 1084 flow [2024-06-27 16:21:59,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 147 transitions, 1016 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 16:21:59,431 INFO L231 Difference]: Finished difference. Result has 51 places, 70 transitions, 575 flow [2024-06-27 16:21:59,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=575, PETRI_PLACES=51, PETRI_TRANSITIONS=70} [2024-06-27 16:21:59,432 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 14 predicate places. [2024-06-27 16:21:59,432 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 70 transitions, 575 flow [2024-06-27 16:21:59,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:59,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:59,432 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:21:59,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 16:21:59,433 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-06-27 16:21:59,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:59,433 INFO L85 PathProgramCache]: Analyzing trace with hash -843841021, now seen corresponding path program 2 times [2024-06-27 16:21:59,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:59,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398526722] [2024-06-27 16:21:59,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:59,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:21:59,467 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:21:59,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:21:59,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398526722] [2024-06-27 16:21:59,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398526722] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:21:59,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:21:59,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:21:59,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958882622] [2024-06-27 16:21:59,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:21:59,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 16:21:59,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:21:59,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 16:21:59,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 16:21:59,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2024-06-27 16:21:59,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 70 transitions, 575 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:59,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:21:59,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2024-06-27 16:21:59,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:22:03,129 INFO L124 PetriNetUnfolderBase]: 41715/58936 cut-off events. [2024-06-27 16:22:03,130 INFO L125 PetriNetUnfolderBase]: For 95225/95225 co-relation queries the response was YES. [2024-06-27 16:22:03,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183311 conditions, 58936 events. 41715/58936 cut-off events. For 95225/95225 co-relation queries the response was YES. Maximal size of possible extension queue 2587. Compared 404952 event pairs, 5243 based on Foata normal form. 740/55052 useless extension candidates. Maximal degree in co-relation 96155. Up to 19534 conditions per place. [2024-06-27 16:22:03,542 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 128 selfloop transitions, 50 changer transitions 0/179 dead transitions. [2024-06-27 16:22:03,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 179 transitions, 1515 flow [2024-06-27 16:22:03,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 16:22:03,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 16:22:03,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-27 16:22:03,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6530612244897959 [2024-06-27 16:22:03,549 INFO L175 Difference]: Start difference. First operand has 51 places, 70 transitions, 575 flow. Second operand 7 states and 128 transitions. [2024-06-27 16:22:03,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 179 transitions, 1515 flow [2024-06-27 16:22:03,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 179 transitions, 1515 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 16:22:04,003 INFO L231 Difference]: Finished difference. Result has 61 places, 95 transitions, 1039 flow [2024-06-27 16:22:04,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1039, PETRI_PLACES=61, PETRI_TRANSITIONS=95} [2024-06-27 16:22:04,008 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 24 predicate places. [2024-06-27 16:22:04,009 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 95 transitions, 1039 flow [2024-06-27 16:22:04,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:04,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:22:04,009 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2024-06-27 16:22:04,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 16:22:04,010 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-06-27 16:22:04,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:22:04,010 INFO L85 PathProgramCache]: Analyzing trace with hash -864337515, now seen corresponding path program 1 times [2024-06-27 16:22:04,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:22:04,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413892929] [2024-06-27 16:22:04,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:22:04,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:22:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:22:04,047 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 16:22:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:22:04,054 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 16:22:04,054 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 16:22:04,054 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-06-27 16:22:04,054 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-06-27 16:22:04,054 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2024-06-27 16:22:04,054 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-06-27 16:22:04,054 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-06-27 16:22:04,054 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-06-27 16:22:04,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 16:22:04,055 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2024-06-27 16:22:04,055 WARN L234 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-27 16:22:04,058 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-06-27 16:22:04,074 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 16:22:04,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 34 transitions, 108 flow [2024-06-27 16:22:04,083 INFO L124 PetriNetUnfolderBase]: 0/44 cut-off events. [2024-06-27 16:22:04,083 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-06-27 16:22:04,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 44 events. 0/44 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 99 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2024-06-27 16:22:04,084 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 34 transitions, 108 flow [2024-06-27 16:22:04,084 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 34 transitions, 108 flow [2024-06-27 16:22:04,087 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:22:04,088 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;@6b4f12c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:22:04,088 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-27 16:22:04,090 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:22:04,090 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2024-06-27 16:22:04,090 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-27 16:22:04,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:22:04,090 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-27 16:22:04,090 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:22:04,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:22:04,091 INFO L85 PathProgramCache]: Analyzing trace with hash -2018703312, now seen corresponding path program 1 times [2024-06-27 16:22:04,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:22:04,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063327770] [2024-06-27 16:22:04,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:22:04,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:22:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:22:04,108 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:04,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:22:04,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063327770] [2024-06-27 16:22:04,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063327770] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:22:04,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:22:04,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:22:04,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716043122] [2024-06-27 16:22:04,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:22:04,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:22:04,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:22:04,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:22:04,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:22:04,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2024-06-27 16:22:04,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:04,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:22:04,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2024-06-27 16:22:04,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:22:09,679 INFO L124 PetriNetUnfolderBase]: 97851/126043 cut-off events. [2024-06-27 16:22:09,680 INFO L125 PetriNetUnfolderBase]: For 36230/36230 co-relation queries the response was YES. [2024-06-27 16:22:09,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264858 conditions, 126043 events. 97851/126043 cut-off events. For 36230/36230 co-relation queries the response was YES. Maximal size of possible extension queue 3452. Compared 715918 event pairs, 56393 based on Foata normal form. 0/105265 useless extension candidates. Maximal degree in co-relation 35315. Up to 84136 conditions per place. [2024-06-27 16:22:10,319 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 53 selfloop transitions, 6 changer transitions 0/60 dead transitions. [2024-06-27 16:22:10,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 60 transitions, 310 flow [2024-06-27 16:22:10,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:22:10,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:22:10,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2024-06-27 16:22:10,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6372549019607843 [2024-06-27 16:22:10,320 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 108 flow. Second operand 3 states and 65 transitions. [2024-06-27 16:22:10,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 60 transitions, 310 flow [2024-06-27 16:22:10,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 286 flow, removed 12 selfloop flow, removed 0 redundant places. [2024-06-27 16:22:10,329 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 140 flow [2024-06-27 16:22:10,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2024-06-27 16:22:10,329 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2024-06-27 16:22:10,330 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 140 flow [2024-06-27 16:22:10,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:10,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:22:10,330 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-06-27 16:22:10,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 16:22:10,330 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:22:10,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:22:10,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1345495534, now seen corresponding path program 1 times [2024-06-27 16:22:10,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:22:10,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331626157] [2024-06-27 16:22:10,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:22:10,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:22:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:22:10,344 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:10,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:22:10,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331626157] [2024-06-27 16:22:10,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331626157] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:22:10,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:22:10,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:22:10,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073541314] [2024-06-27 16:22:10,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:22:10,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:22:10,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:22:10,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:22:10,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:22:10,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2024-06-27 16:22:10,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:10,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:22:10,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2024-06-27 16:22:10,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:22:19,240 INFO L124 PetriNetUnfolderBase]: 140281/181269 cut-off events. [2024-06-27 16:22:19,240 INFO L125 PetriNetUnfolderBase]: For 76649/76649 co-relation queries the response was YES. [2024-06-27 16:22:19,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429056 conditions, 181269 events. 140281/181269 cut-off events. For 76649/76649 co-relation queries the response was YES. Maximal size of possible extension queue 5212. Compared 1083813 event pairs, 73535 based on Foata normal form. 0/157427 useless extension candidates. Maximal degree in co-relation 382197. Up to 121118 conditions per place. [2024-06-27 16:22:20,578 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 57 selfloop transitions, 10 changer transitions 0/68 dead transitions. [2024-06-27 16:22:20,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 68 transitions, 379 flow [2024-06-27 16:22:20,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:22:20,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:22:20,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2024-06-27 16:22:20,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6078431372549019 [2024-06-27 16:22:20,579 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 140 flow. Second operand 3 states and 62 transitions. [2024-06-27 16:22:20,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 68 transitions, 379 flow [2024-06-27 16:22:22,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 68 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 16:22:22,353 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 216 flow [2024-06-27 16:22:22,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2024-06-27 16:22:22,354 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places. [2024-06-27 16:22:22,354 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 216 flow [2024-06-27 16:22:22,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:22,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:22:22,355 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:22:22,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 16:22:22,355 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-06-27 16:22:22,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:22:22,356 INFO L85 PathProgramCache]: Analyzing trace with hash 235023738, now seen corresponding path program 1 times [2024-06-27 16:22:22,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:22:22,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234436507] [2024-06-27 16:22:22,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:22:22,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:22:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:22:22,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-06-27 16:22:22,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:22:22,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234436507] [2024-06-27 16:22:22,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234436507] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:22:22,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:22:22,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:22:22,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173213729] [2024-06-27 16:22:22,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:22:22,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:22:22,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:22:22,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:22:22,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:22:22,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2024-06-27 16:22:22,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:22,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:22:22,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2024-06-27 16:22:22,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand