/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked TOGETHER -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/weaver_parallel-bakery-2.wvr_bound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 19:57:40,140 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 19:57:40,196 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 19:57:40,201 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 19:57:40,201 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 19:57:40,201 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 19:57:40,202 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 19:57:40,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 19:57:40,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 19:57:40,226 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 19:57:40,226 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 19:57:40,226 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 19:57:40,227 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 19:57:40,228 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 19:57:40,228 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 19:57:40,228 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 19:57:40,228 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 19:57:40,228 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 19:57:40,229 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 19:57:40,229 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 19:57:40,229 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 19:57:40,229 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 19:57:40,229 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 19:57:40,229 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 19:57:40,230 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 19:57:40,230 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 19:57:40,230 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 19:57:40,231 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 19:57:40,231 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 19:57:40,231 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 19:57:40,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 19:57:40,232 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 19:57:40,232 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 19:57:40,232 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 19:57:40,232 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 19:57:40,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 19:57:40,232 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 19:57:40,232 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 19:57:40,233 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 19:57:40,233 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 19:57:40,233 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 19:57:40,233 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.traceabstraction: Order of the error locations to be checked -> TOGETHER [2023-08-03 19:57:40,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 19:57:40,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 19:57:40,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 19:57:40,438 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 19:57:40,439 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 19:57:40,442 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/weaver_parallel-bakery-2.wvr_bound2.c [2023-08-03 19:57:41,282 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 19:57:41,432 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 19:57:41,433 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/weaver_parallel-bakery-2.wvr_bound2.c [2023-08-03 19:57:41,438 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffd5ffc72/9b555331d86944818566ea59963e7353/FLAG451010785 [2023-08-03 19:57:41,447 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffd5ffc72/9b555331d86944818566ea59963e7353 [2023-08-03 19:57:41,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 19:57:41,449 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 19:57:41,450 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 19:57:41,450 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 19:57:41,452 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 19:57:41,452 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 07:57:41" (1/1) ... [2023-08-03 19:57:41,453 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4de5c791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 07:57:41, skipping insertion in model container [2023-08-03 19:57:41,453 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 07:57:41" (1/1) ... [2023-08-03 19:57:41,468 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 19:57:41,579 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_parallel-bakery-2.wvr_bound2.c[3674,3687] [2023-08-03 19:57:41,579 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 19:57:41,585 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 19:57:41,600 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_parallel-bakery-2.wvr_bound2.c[3674,3687] [2023-08-03 19:57:41,601 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 19:57:41,605 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 19:57:41,605 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 19:57:41,609 INFO L206 MainTranslator]: Completed translation [2023-08-03 19:57:41,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 07:57:41 WrapperNode [2023-08-03 19:57:41,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 19:57:41,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 19:57:41,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 19:57:41,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 19:57:41,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 07:57:41" (1/1) ... [2023-08-03 19:57:41,621 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 07:57:41" (1/1) ... [2023-08-03 19:57:41,635 INFO L138 Inliner]: procedures = 21, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 187 [2023-08-03 19:57:41,636 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 19:57:41,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 19:57:41,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 19:57:41,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 19:57:41,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 07:57:41" (1/1) ... [2023-08-03 19:57:41,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 07:57:41" (1/1) ... [2023-08-03 19:57:41,646 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 07:57:41" (1/1) ... [2023-08-03 19:57:41,646 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 07:57:41" (1/1) ... [2023-08-03 19:57:41,650 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 07:57:41" (1/1) ... [2023-08-03 19:57:41,653 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 07:57:41" (1/1) ... [2023-08-03 19:57:41,654 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 07:57:41" (1/1) ... [2023-08-03 19:57:41,655 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 07:57:41" (1/1) ... [2023-08-03 19:57:41,656 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 19:57:41,657 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 19:57:41,657 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 19:57:41,657 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 19:57:41,658 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 07:57:41" (1/1) ... [2023-08-03 19:57:41,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 19:57:41,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 19:57:41,682 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-03 19:57:41,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-03 19:57:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 19:57:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-03 19:57:41,715 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-03 19:57:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-03 19:57:41,715 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-03 19:57:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 19:57:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 19:57:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 19:57:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 19:57:41,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 19:57:41,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 19:57:41,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 19:57:41,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-03 19:57:41,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 19:57:41,718 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-03 19:57:41,804 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 19:57:41,806 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 19:57:42,001 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 19:57:42,037 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 19:57:42,037 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-03 19:57:42,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 07:57:42 BoogieIcfgContainer [2023-08-03 19:57:42,039 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 19:57:42,041 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 19:57:42,041 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 19:57:42,043 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 19:57:42,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 07:57:41" (1/3) ... [2023-08-03 19:57:42,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4968ed03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 07:57:42, skipping insertion in model container [2023-08-03 19:57:42,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 07:57:41" (2/3) ... [2023-08-03 19:57:42,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4968ed03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 07:57:42, skipping insertion in model container [2023-08-03 19:57:42,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 07:57:42" (3/3) ... [2023-08-03 19:57:42,044 INFO L112 eAbstractionObserver]: Analyzing ICFG weaver_parallel-bakery-2.wvr_bound2.c [2023-08-03 19:57:42,049 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 19:57:42,055 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 19:57:42,055 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-03 19:57:42,055 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 19:57:42,095 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-03 19:57:42,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 138 transitions, 298 flow [2023-08-03 19:57:42,195 INFO L124 PetriNetUnfolderBase]: 27/279 cut-off events. [2023-08-03 19:57:42,195 INFO L125 PetriNetUnfolderBase]: For 8/12 co-relation queries the response was YES. [2023-08-03 19:57:42,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 279 events. 27/279 cut-off events. For 8/12 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 954 event pairs, 0 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 162. Up to 8 conditions per place. [2023-08-03 19:57:42,200 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 138 transitions, 298 flow [2023-08-03 19:57:42,202 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 130 transitions, 282 flow [2023-08-03 19:57:42,204 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 19:57:42,215 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 130 transitions, 282 flow [2023-08-03 19:57:42,220 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 130 transitions, 282 flow [2023-08-03 19:57:42,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 130 transitions, 282 flow [2023-08-03 19:57:42,268 INFO L124 PetriNetUnfolderBase]: 27/247 cut-off events. [2023-08-03 19:57:42,268 INFO L125 PetriNetUnfolderBase]: For 8/12 co-relation queries the response was YES. [2023-08-03 19:57:42,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 247 events. 27/247 cut-off events. For 8/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 732 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 146. Up to 8 conditions per place. [2023-08-03 19:57:42,273 INFO L119 LiptonReduction]: Number of co-enabled transitions 2310 [2023-08-03 19:57:44,517 INFO L134 LiptonReduction]: Checked pairs total: 12780 [2023-08-03 19:57:44,518 INFO L136 LiptonReduction]: Total number of compositions: 99 [2023-08-03 19:57:44,527 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 19:57:44,531 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=LoopsAndPotentialCycles, 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;@2fec3b02, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 19:57:44,531 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-03 19:57:44,533 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 19:57:44,534 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-08-03 19:57:44,534 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 19:57:44,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 19:57:44,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 19:57:44,534 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 19:57:44,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 19:57:44,538 INFO L85 PathProgramCache]: Analyzing trace with hash 517513331, now seen corresponding path program 1 times [2023-08-03 19:57:44,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 19:57:44,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895491381] [2023-08-03 19:57:44,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 19:57:44,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 19:57:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 19:57:44,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 19:57:44,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 19:57:44,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895491381] [2023-08-03 19:57:44,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895491381] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 19:57:44,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 19:57:44,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 19:57:44,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586855088] [2023-08-03 19:57:44,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 19:57:44,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 19:57:44,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 19:57:44,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 19:57:44,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 19:57:44,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 237 [2023-08-03 19:57:44,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 41 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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) [2023-08-03 19:57:44,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 19:57:44,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 237 [2023-08-03 19:57:44,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 19:57:44,826 INFO L124 PetriNetUnfolderBase]: 390/889 cut-off events. [2023-08-03 19:57:44,826 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-08-03 19:57:44,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1635 conditions, 889 events. 390/889 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5502 event pairs, 368 based on Foata normal form. 0/755 useless extension candidates. Maximal degree in co-relation 1435. Up to 688 conditions per place. [2023-08-03 19:57:44,833 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 30 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-08-03 19:57:44,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 46 transitions, 178 flow [2023-08-03 19:57:44,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 19:57:44,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 19:57:44,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2023-08-03 19:57:44,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5316455696202531 [2023-08-03 19:57:44,849 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2023-08-03 19:57:44,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2023-08-03 19:57:44,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 19:57:44,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2023-08-03 19:57:44,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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) [2023-08-03 19:57:44,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 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) [2023-08-03 19:57:44,861 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 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) [2023-08-03 19:57:44,862 INFO L175 Difference]: Start difference. First operand has 42 places, 41 transitions, 104 flow. Second operand 3 states and 378 transitions. [2023-08-03 19:57:44,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 46 transitions, 178 flow [2023-08-03 19:57:44,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 178 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 19:57:44,868 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 112 flow [2023-08-03 19:57:44,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2023-08-03 19:57:44,872 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2023-08-03 19:57:44,872 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 112 flow [2023-08-03 19:57:44,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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) [2023-08-03 19:57:44,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 19:57:44,872 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 19:57:44,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 19:57:44,873 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 19:57:44,873 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 19:57:44,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1100692397, now seen corresponding path program 1 times [2023-08-03 19:57:44,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 19:57:44,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329317340] [2023-08-03 19:57:44,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 19:57:44,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 19:57:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 19:57:44,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 19:57:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 19:57:44,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 19:57:44,952 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 19:57:44,953 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-03 19:57:44,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-03 19:57:44,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-03 19:57:44,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 19:57:44,955 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 19:57:44,957 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 19:57:44,957 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 19:57:44,986 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2023-08-03 19:57:44,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 166 transitions, 380 flow [2023-08-03 19:57:45,063 INFO L124 PetriNetUnfolderBase]: 118/859 cut-off events. [2023-08-03 19:57:45,063 INFO L125 PetriNetUnfolderBase]: For 72/85 co-relation queries the response was YES. [2023-08-03 19:57:45,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 859 events. 118/859 cut-off events. For 72/85 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4613 event pairs, 1 based on Foata normal form. 0/738 useless extension candidates. Maximal degree in co-relation 509. Up to 32 conditions per place. [2023-08-03 19:57:45,066 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 166 transitions, 380 flow [2023-08-03 19:57:45,069 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 158 transitions, 364 flow [2023-08-03 19:57:45,069 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 19:57:45,069 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 158 transitions, 364 flow [2023-08-03 19:57:45,071 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 158 transitions, 364 flow [2023-08-03 19:57:45,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 158 transitions, 364 flow [2023-08-03 19:57:45,127 INFO L124 PetriNetUnfolderBase]: 118/731 cut-off events. [2023-08-03 19:57:45,127 INFO L125 PetriNetUnfolderBase]: For 72/85 co-relation queries the response was YES. [2023-08-03 19:57:45,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 731 events. 118/731 cut-off events. For 72/85 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3710 event pairs, 1 based on Foata normal form. 0/626 useless extension candidates. Maximal degree in co-relation 445. Up to 32 conditions per place. [2023-08-03 19:57:45,138 INFO L119 LiptonReduction]: Number of co-enabled transitions 6028 [2023-08-03 19:57:47,140 INFO L134 LiptonReduction]: Checked pairs total: 41603 [2023-08-03 19:57:47,140 INFO L136 LiptonReduction]: Total number of compositions: 101 [2023-08-03 19:57:47,142 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 19:57:47,143 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=LoopsAndPotentialCycles, 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;@2fec3b02, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 19:57:47,143 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-03 19:57:47,144 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 19:57:47,144 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-08-03 19:57:47,144 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 19:57:47,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 19:57:47,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 19:57:47,147 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 19:57:47,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 19:57:47,151 INFO L85 PathProgramCache]: Analyzing trace with hash 797122712, now seen corresponding path program 1 times [2023-08-03 19:57:47,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 19:57:47,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987163863] [2023-08-03 19:57:47,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 19:57:47,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 19:57:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 19:57:47,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 19:57:47,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 19:57:47,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987163863] [2023-08-03 19:57:47,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987163863] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 19:57:47,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 19:57:47,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 19:57:47,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728368732] [2023-08-03 19:57:47,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 19:57:47,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 19:57:47,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 19:57:47,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 19:57:47,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 19:57:47,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 267 [2023-08-03 19:57:47,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 67 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 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) [2023-08-03 19:57:47,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 19:57:47,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 267 [2023-08-03 19:57:47,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 19:57:50,089 INFO L124 PetriNetUnfolderBase]: 28950/47414 cut-off events. [2023-08-03 19:57:50,089 INFO L125 PetriNetUnfolderBase]: For 3550/3550 co-relation queries the response was YES. [2023-08-03 19:57:50,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89677 conditions, 47414 events. 28950/47414 cut-off events. For 3550/3550 co-relation queries the response was YES. Maximal size of possible extension queue 1690. Compared 415041 event pairs, 27614 based on Foata normal form. 0/42759 useless extension candidates. Maximal degree in co-relation 47336. Up to 39618 conditions per place. [2023-08-03 19:57:50,301 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 45 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2023-08-03 19:57:50,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 73 transitions, 288 flow [2023-08-03 19:57:50,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 19:57:50,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 19:57:50,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions. [2023-08-03 19:57:50,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.550561797752809 [2023-08-03 19:57:50,303 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 441 transitions. [2023-08-03 19:57:50,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions. [2023-08-03 19:57:50,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 19:57:50,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions. [2023-08-03 19:57:50,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 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) [2023-08-03 19:57:50,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-03 19:57:50,306 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-03 19:57:50,306 INFO L175 Difference]: Start difference. First operand has 68 places, 67 transitions, 182 flow. Second operand 3 states and 441 transitions. [2023-08-03 19:57:50,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 73 transitions, 288 flow [2023-08-03 19:57:50,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 73 transitions, 288 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 19:57:50,314 INFO L231 Difference]: Finished difference. Result has 71 places, 68 transitions, 194 flow [2023-08-03 19:57:50,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=71, PETRI_TRANSITIONS=68} [2023-08-03 19:57:50,315 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-08-03 19:57:50,315 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 68 transitions, 194 flow [2023-08-03 19:57:50,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 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) [2023-08-03 19:57:50,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 19:57:50,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 19:57:50,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 19:57:50,316 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 19:57:50,316 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 19:57:50,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1648111792, now seen corresponding path program 1 times [2023-08-03 19:57:50,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 19:57:50,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74548601] [2023-08-03 19:57:50,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 19:57:50,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 19:57:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 19:57:50,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 19:57:50,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 19:57:50,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74548601] [2023-08-03 19:57:50,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74548601] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 19:57:50,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796312894] [2023-08-03 19:57:50,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 19:57:50,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 19:57:50,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 19:57:50,354 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 19:57:50,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-03 19:57:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 19:57:50,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 19:57:50,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 19:57:50,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 19:57:50,436 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 19:57:50,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796312894] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 19:57:50,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 19:57:50,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-03 19:57:50,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481788823] [2023-08-03 19:57:50,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 19:57:50,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 19:57:50,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 19:57:50,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 19:57:50,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 19:57:50,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 267 [2023-08-03 19:57:50,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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) [2023-08-03 19:57:50,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 19:57:50,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 267 [2023-08-03 19:57:50,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 19:57:52,823 INFO L124 PetriNetUnfolderBase]: 28920/46393 cut-off events. [2023-08-03 19:57:52,824 INFO L125 PetriNetUnfolderBase]: For 3500/3500 co-relation queries the response was YES. [2023-08-03 19:57:52,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88814 conditions, 46393 events. 28920/46393 cut-off events. For 3500/3500 co-relation queries the response was YES. Maximal size of possible extension queue 1677. Compared 396658 event pairs, 27196 based on Foata normal form. 0/41978 useless extension candidates. Maximal degree in co-relation 56201. Up to 39077 conditions per place. [2023-08-03 19:57:53,014 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 54 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2023-08-03 19:57:53,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 82 transitions, 334 flow [2023-08-03 19:57:53,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 19:57:53,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 19:57:53,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2023-08-03 19:57:53,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5605493133583022 [2023-08-03 19:57:53,017 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2023-08-03 19:57:53,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2023-08-03 19:57:53,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 19:57:53,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2023-08-03 19:57:53,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 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) [2023-08-03 19:57:53,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-03 19:57:53,024 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-03 19:57:53,024 INFO L175 Difference]: Start difference. First operand has 71 places, 68 transitions, 194 flow. Second operand 3 states and 449 transitions. [2023-08-03 19:57:53,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 82 transitions, 334 flow [2023-08-03 19:57:53,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 82 transitions, 332 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 19:57:53,028 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 204 flow [2023-08-03 19:57:53,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2023-08-03 19:57:53,030 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2023-08-03 19:57:53,030 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 204 flow [2023-08-03 19:57:53,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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) [2023-08-03 19:57:53,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 19:57:53,031 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 19:57:53,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-03 19:57:53,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 19:57:53,235 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 19:57:53,235 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 19:57:53,236 INFO L85 PathProgramCache]: Analyzing trace with hash 2121769393, now seen corresponding path program 1 times [2023-08-03 19:57:53,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 19:57:53,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84519813] [2023-08-03 19:57:53,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 19:57:53,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 19:57:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 19:57:53,310 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 19:57:53,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 19:57:53,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84519813] [2023-08-03 19:57:53,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84519813] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 19:57:53,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628582341] [2023-08-03 19:57:53,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 19:57:53,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 19:57:53,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 19:57:53,325 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 19:57:53,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-03 19:57:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 19:57:53,371 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 19:57:53,373 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 19:57:53,406 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 19:57:53,406 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 19:57:53,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628582341] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 19:57:53,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 19:57:53,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 19:57:53,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466863499] [2023-08-03 19:57:53,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 19:57:53,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 19:57:53,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 19:57:53,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 19:57:53,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 19:57:53,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 267 [2023-08-03 19:57:53,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 204 flow. Second operand has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 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) [2023-08-03 19:57:53,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 19:57:53,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 267 [2023-08-03 19:57:53,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 19:57:55,982 INFO L124 PetriNetUnfolderBase]: 28880/45977 cut-off events. [2023-08-03 19:57:55,982 INFO L125 PetriNetUnfolderBase]: For 4805/4805 co-relation queries the response was YES. [2023-08-03 19:57:56,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90351 conditions, 45977 events. 28880/45977 cut-off events. For 4805/4805 co-relation queries the response was YES. Maximal size of possible extension queue 1691. Compared 392195 event pairs, 13372 based on Foata normal form. 25/42732 useless extension candidates. Maximal degree in co-relation 20070. Up to 39459 conditions per place. [2023-08-03 19:57:56,168 INFO L140 encePairwiseOnDemand]: 263/267 looper letters, 53 selfloop transitions, 4 changer transitions 0/82 dead transitions. [2023-08-03 19:57:56,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 82 transitions, 345 flow [2023-08-03 19:57:56,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 19:57:56,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 19:57:56,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 707 transitions. [2023-08-03 19:57:56,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5295880149812734 [2023-08-03 19:57:56,170 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 707 transitions. [2023-08-03 19:57:56,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 707 transitions. [2023-08-03 19:57:56,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 19:57:56,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 707 transitions. [2023-08-03 19:57:56,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.4) internal successors, (707), 5 states have internal predecessors, (707), 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) [2023-08-03 19:57:56,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-03 19:57:56,174 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-03 19:57:56,174 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 204 flow. Second operand 5 states and 707 transitions. [2023-08-03 19:57:56,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 82 transitions, 345 flow [2023-08-03 19:57:56,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 82 transitions, 336 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 19:57:56,178 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 213 flow [2023-08-03 19:57:56,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=213, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2023-08-03 19:57:56,178 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 7 predicate places. [2023-08-03 19:57:56,179 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 213 flow [2023-08-03 19:57:56,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 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) [2023-08-03 19:57:56,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 19:57:56,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 19:57:56,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-03 19:57:56,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 19:57:56,385 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 19:57:56,386 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 19:57:56,386 INFO L85 PathProgramCache]: Analyzing trace with hash -87292336, now seen corresponding path program 1 times [2023-08-03 19:57:56,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 19:57:56,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665168538] [2023-08-03 19:57:56,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 19:57:56,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 19:57:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 19:57:56,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 19:57:56,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 19:57:56,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665168538] [2023-08-03 19:57:56,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665168538] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 19:57:56,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656334958] [2023-08-03 19:57:56,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 19:57:56,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 19:57:56,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 19:57:56,435 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 19:57:56,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-03 19:57:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 19:57:56,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 19:57:56,481 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 19:57:56,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-03 19:57:56,488 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 19:57:56,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656334958] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 19:57:56,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 19:57:56,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-03 19:57:56,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849824971] [2023-08-03 19:57:56,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 19:57:56,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 19:57:56,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 19:57:56,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 19:57:56,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 19:57:56,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 267 [2023-08-03 19:57:56,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 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) [2023-08-03 19:57:56,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 19:57:56,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 267 [2023-08-03 19:57:56,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 19:57:58,640 INFO L124 PetriNetUnfolderBase]: 22553/35259 cut-off events. [2023-08-03 19:57:58,640 INFO L125 PetriNetUnfolderBase]: For 3447/3447 co-relation queries the response was YES. [2023-08-03 19:57:58,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70827 conditions, 35259 events. 22553/35259 cut-off events. For 3447/3447 co-relation queries the response was YES. Maximal size of possible extension queue 1137. Compared 282461 event pairs, 15148 based on Foata normal form. 0/32940 useless extension candidates. Maximal degree in co-relation 31262. Up to 22365 conditions per place. [2023-08-03 19:57:58,766 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 64 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2023-08-03 19:57:58,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 91 transitions, 399 flow [2023-08-03 19:57:58,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 19:57:58,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 19:57:58,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2023-08-03 19:57:58,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5705368289637952 [2023-08-03 19:57:58,768 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 457 transitions. [2023-08-03 19:57:58,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions. [2023-08-03 19:57:58,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 19:57:58,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions. [2023-08-03 19:57:58,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 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) [2023-08-03 19:57:58,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-03 19:57:58,771 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-03 19:57:58,771 INFO L175 Difference]: Start difference. First operand has 75 places, 69 transitions, 213 flow. Second operand 3 states and 457 transitions. [2023-08-03 19:57:58,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 91 transitions, 399 flow [2023-08-03 19:57:58,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 91 transitions, 392 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-03 19:57:58,774 INFO L231 Difference]: Finished difference. Result has 76 places, 70 transitions, 218 flow [2023-08-03 19:57:58,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=76, PETRI_TRANSITIONS=70} [2023-08-03 19:57:58,774 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 8 predicate places. [2023-08-03 19:57:58,774 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 70 transitions, 218 flow [2023-08-03 19:57:58,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 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) [2023-08-03 19:57:58,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 19:57:58,775 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 19:57:58,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-03 19:57:58,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 19:57:58,979 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 19:57:58,979 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 19:57:58,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1439276478, now seen corresponding path program 1 times [2023-08-03 19:57:58,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 19:57:58,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083819194] [2023-08-03 19:57:58,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 19:57:58,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 19:57:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 19:57:59,022 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 19:57:59,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 19:57:59,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083819194] [2023-08-03 19:57:59,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083819194] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 19:57:59,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558920850] [2023-08-03 19:57:59,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 19:57:59,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 19:57:59,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 19:57:59,025 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 19:57:59,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-03 19:57:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 19:57:59,073 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 19:57:59,073 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 19:57:59,086 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 19:57:59,086 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 19:57:59,102 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 19:57:59,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558920850] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 19:57:59,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 19:57:59,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 19:57:59,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237368908] [2023-08-03 19:57:59,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 19:57:59,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 19:57:59,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 19:57:59,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 19:57:59,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 19:57:59,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 267 [2023-08-03 19:57:59,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 70 transitions, 218 flow. Second operand has 5 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 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) [2023-08-03 19:57:59,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 19:57:59,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 267 [2023-08-03 19:57:59,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 19:58:00,959 INFO L124 PetriNetUnfolderBase]: 20792/32849 cut-off events. [2023-08-03 19:58:00,959 INFO L125 PetriNetUnfolderBase]: For 6727/6727 co-relation queries the response was YES. [2023-08-03 19:58:01,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68033 conditions, 32849 events. 20792/32849 cut-off events. For 6727/6727 co-relation queries the response was YES. Maximal size of possible extension queue 1128. Compared 262725 event pairs, 14941 based on Foata normal form. 5/31743 useless extension candidates. Maximal degree in co-relation 21510. Up to 28862 conditions per place. [2023-08-03 19:58:01,102 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 54 selfloop transitions, 3 changer transitions 0/82 dead transitions. [2023-08-03 19:58:01,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 82 transitions, 352 flow [2023-08-03 19:58:01,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 19:58:01,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 19:58:01,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 576 transitions. [2023-08-03 19:58:01,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5393258426966292 [2023-08-03 19:58:01,104 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 576 transitions. [2023-08-03 19:58:01,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 576 transitions. [2023-08-03 19:58:01,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 19:58:01,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 576 transitions. [2023-08-03 19:58:01,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 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) [2023-08-03 19:58:01,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 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) [2023-08-03 19:58:01,107 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 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) [2023-08-03 19:58:01,107 INFO L175 Difference]: Start difference. First operand has 76 places, 70 transitions, 218 flow. Second operand 4 states and 576 transitions. [2023-08-03 19:58:01,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 82 transitions, 352 flow [2023-08-03 19:58:01,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 82 transitions, 350 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 19:58:01,188 INFO L231 Difference]: Finished difference. Result has 78 places, 69 transitions, 214 flow [2023-08-03 19:58:01,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=214, PETRI_PLACES=78, PETRI_TRANSITIONS=69} [2023-08-03 19:58:01,189 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 10 predicate places. [2023-08-03 19:58:01,189 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 69 transitions, 214 flow [2023-08-03 19:58:01,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 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) [2023-08-03 19:58:01,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 19:58:01,190 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 19:58:01,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-03 19:58:01,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 19:58:01,397 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 19:58:01,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 19:58:01,397 INFO L85 PathProgramCache]: Analyzing trace with hash -68576727, now seen corresponding path program 1 times [2023-08-03 19:58:01,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 19:58:01,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258505112] [2023-08-03 19:58:01,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 19:58:01,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 19:58:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 19:58:01,579 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 19:58:01,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 19:58:01,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258505112] [2023-08-03 19:58:01,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258505112] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 19:58:01,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372754255] [2023-08-03 19:58:01,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 19:58:01,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 19:58:01,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 19:58:01,581 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 19:58:01,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-03 19:58:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 19:58:01,630 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 19:58:01,631 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 19:58:01,646 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 19:58:01,647 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 19:58:01,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372754255] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 19:58:01,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 19:58:01,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-03 19:58:01,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096827665] [2023-08-03 19:58:01,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 19:58:01,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 19:58:01,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 19:58:01,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 19:58:01,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 19:58:01,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 267 [2023-08-03 19:58:01,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 69 transitions, 214 flow. Second operand has 5 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 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) [2023-08-03 19:58:01,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 19:58:01,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 267 [2023-08-03 19:58:01,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 19:58:03,307 INFO L124 PetriNetUnfolderBase]: 18792/29402 cut-off events. [2023-08-03 19:58:03,307 INFO L125 PetriNetUnfolderBase]: For 5456/5456 co-relation queries the response was YES. [2023-08-03 19:58:03,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60967 conditions, 29402 events. 18792/29402 cut-off events. For 5456/5456 co-relation queries the response was YES. Maximal size of possible extension queue 975. Compared 227688 event pairs, 5040 based on Foata normal form. 625/29139 useless extension candidates. Maximal degree in co-relation 29370. Up to 22741 conditions per place. [2023-08-03 19:58:03,409 INFO L140 encePairwiseOnDemand]: 263/267 looper letters, 78 selfloop transitions, 4 changer transitions 0/106 dead transitions. [2023-08-03 19:58:03,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 106 transitions, 452 flow [2023-08-03 19:58:03,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 19:58:03,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 19:58:03,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 731 transitions. [2023-08-03 19:58:03,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.547565543071161 [2023-08-03 19:58:03,411 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 731 transitions. [2023-08-03 19:58:03,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 731 transitions. [2023-08-03 19:58:03,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 19:58:03,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 731 transitions. [2023-08-03 19:58:03,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.2) internal successors, (731), 5 states have internal predecessors, (731), 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) [2023-08-03 19:58:03,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-03 19:58:03,414 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-03 19:58:03,414 INFO L175 Difference]: Start difference. First operand has 78 places, 69 transitions, 214 flow. Second operand 5 states and 731 transitions. [2023-08-03 19:58:03,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 106 transitions, 452 flow [2023-08-03 19:58:03,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 106 transitions, 440 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-03 19:58:03,437 INFO L231 Difference]: Finished difference. Result has 78 places, 69 transitions, 219 flow [2023-08-03 19:58:03,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=219, PETRI_PLACES=78, PETRI_TRANSITIONS=69} [2023-08-03 19:58:03,438 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 10 predicate places. [2023-08-03 19:58:03,438 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 69 transitions, 219 flow [2023-08-03 19:58:03,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 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) [2023-08-03 19:58:03,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 19:58:03,438 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 19:58:03,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-03 19:58:03,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 19:58:03,642 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 19:58:03,642 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 19:58:03,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1306449723, now seen corresponding path program 1 times [2023-08-03 19:58:03,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 19:58:03,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167274316] [2023-08-03 19:58:03,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 19:58:03,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 19:58:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 19:58:03,676 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-03 19:58:03,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 19:58:03,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167274316] [2023-08-03 19:58:03,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167274316] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 19:58:03,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700689469] [2023-08-03 19:58:03,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 19:58:03,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 19:58:03,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 19:58:03,678 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 19:58:03,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-03 19:58:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 19:58:03,734 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 19:58:03,735 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 19:58:03,742 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 19:58:03,742 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 19:58:03,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700689469] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 19:58:03,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 19:58:03,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-08-03 19:58:03,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342754409] [2023-08-03 19:58:03,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 19:58:03,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 19:58:03,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 19:58:03,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 19:58:03,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 19:58:03,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 267 [2023-08-03 19:58:03,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 69 transitions, 219 flow. Second operand has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 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) [2023-08-03 19:58:03,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 19:58:03,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 267 [2023-08-03 19:58:03,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 19:58:05,542 INFO L124 PetriNetUnfolderBase]: 18013/28362 cut-off events. [2023-08-03 19:58:05,542 INFO L125 PetriNetUnfolderBase]: For 9708/9708 co-relation queries the response was YES. [2023-08-03 19:58:05,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61006 conditions, 28362 events. 18013/28362 cut-off events. For 9708/9708 co-relation queries the response was YES. Maximal size of possible extension queue 900. Compared 221071 event pairs, 14497 based on Foata normal form. 0/27691 useless extension candidates. Maximal degree in co-relation 29439. Up to 20517 conditions per place. [2023-08-03 19:58:05,635 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 65 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2023-08-03 19:58:05,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 91 transitions, 405 flow [2023-08-03 19:58:05,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 19:58:05,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 19:58:05,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2023-08-03 19:58:05,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5705368289637952 [2023-08-03 19:58:05,646 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 457 transitions. [2023-08-03 19:58:05,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions. [2023-08-03 19:58:05,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 19:58:05,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions. [2023-08-03 19:58:05,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 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) [2023-08-03 19:58:05,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-03 19:58:05,648 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-03 19:58:05,648 INFO L175 Difference]: Start difference. First operand has 78 places, 69 transitions, 219 flow. Second operand 3 states and 457 transitions. [2023-08-03 19:58:05,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 91 transitions, 405 flow [2023-08-03 19:58:05,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 91 transitions, 398 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-03 19:58:05,696 INFO L231 Difference]: Finished difference. Result has 79 places, 70 transitions, 224 flow [2023-08-03 19:58:05,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=79, PETRI_TRANSITIONS=70} [2023-08-03 19:58:05,696 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 11 predicate places. [2023-08-03 19:58:05,696 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 70 transitions, 224 flow [2023-08-03 19:58:05,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 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) [2023-08-03 19:58:05,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 19:58:05,697 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 19:58:05,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-03 19:58:05,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 19:58:05,898 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 19:58:05,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 19:58:05,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1216151448, now seen corresponding path program 1 times [2023-08-03 19:58:05,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 19:58:05,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133148904] [2023-08-03 19:58:05,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 19:58:05,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 19:58:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 19:58:05,949 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 19:58:05,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 19:58:05,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133148904] [2023-08-03 19:58:05,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133148904] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 19:58:05,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944266444] [2023-08-03 19:58:05,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 19:58:05,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 19:58:05,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 19:58:05,951 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 19:58:05,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-03 19:58:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 19:58:06,012 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 19:58:06,014 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 19:58:06,030 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 19:58:06,031 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 19:58:06,044 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 19:58:06,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944266444] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 19:58:06,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 19:58:06,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 19:58:06,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792116965] [2023-08-03 19:58:06,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 19:58:06,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 19:58:06,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 19:58:06,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 19:58:06,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 19:58:06,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 267 [2023-08-03 19:58:06,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 70 transitions, 224 flow. Second operand has 5 states, 5 states have (on average 136.0) internal successors, (680), 5 states have internal predecessors, (680), 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) [2023-08-03 19:58:06,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 19:58:06,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 267 [2023-08-03 19:58:06,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 19:58:07,513 INFO L124 PetriNetUnfolderBase]: 17218/27137 cut-off events. [2023-08-03 19:58:07,514 INFO L125 PetriNetUnfolderBase]: For 8379/8379 co-relation queries the response was YES. [2023-08-03 19:58:07,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58592 conditions, 27137 events. 17218/27137 cut-off events. For 8379/8379 co-relation queries the response was YES. Maximal size of possible extension queue 832. Compared 209506 event pairs, 10522 based on Foata normal form. 125/27020 useless extension candidates. Maximal degree in co-relation 43785. Up to 20841 conditions per place. [2023-08-03 19:58:07,781 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 71 selfloop transitions, 3 changer transitions 0/98 dead transitions. [2023-08-03 19:58:07,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 98 transitions, 424 flow [2023-08-03 19:58:07,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 19:58:07,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 19:58:07,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 592 transitions. [2023-08-03 19:58:07,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5543071161048689 [2023-08-03 19:58:07,782 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 592 transitions. [2023-08-03 19:58:07,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 592 transitions. [2023-08-03 19:58:07,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 19:58:07,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 592 transitions. [2023-08-03 19:58:07,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 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) [2023-08-03 19:58:07,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 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) [2023-08-03 19:58:07,785 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 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) [2023-08-03 19:58:07,785 INFO L175 Difference]: Start difference. First operand has 79 places, 70 transitions, 224 flow. Second operand 4 states and 592 transitions. [2023-08-03 19:58:07,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 98 transitions, 424 flow [2023-08-03 19:58:07,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 98 transitions, 422 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 19:58:07,898 INFO L231 Difference]: Finished difference. Result has 81 places, 69 transitions, 220 flow [2023-08-03 19:58:07,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=81, PETRI_TRANSITIONS=69} [2023-08-03 19:58:07,898 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 13 predicate places. [2023-08-03 19:58:07,898 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 69 transitions, 220 flow [2023-08-03 19:58:07,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.0) internal successors, (680), 5 states have internal predecessors, (680), 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) [2023-08-03 19:58:07,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 19:58:07,899 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 19:58:07,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-03 19:58:08,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 19:58:08,103 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 19:58:08,103 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 19:58:08,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1458585801, now seen corresponding path program 1 times [2023-08-03 19:58:08,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 19:58:08,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943526025] [2023-08-03 19:58:08,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 19:58:08,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 19:58:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 19:58:08,142 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-03 19:58:08,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 19:58:08,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943526025] [2023-08-03 19:58:08,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943526025] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 19:58:08,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371063023] [2023-08-03 19:58:08,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 19:58:08,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 19:58:08,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 19:58:08,144 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 19:58:08,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-03 19:58:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 19:58:08,209 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 19:58:08,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 19:58:08,219 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-03 19:58:08,219 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 19:58:08,230 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-03 19:58:08,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371063023] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 19:58:08,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 19:58:08,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 19:58:08,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517150163] [2023-08-03 19:58:08,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 19:58:08,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 19:58:08,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 19:58:08,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 19:58:08,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 19:58:08,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 267 [2023-08-03 19:58:08,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 69 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 136.2) internal successors, (681), 5 states have internal predecessors, (681), 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) [2023-08-03 19:58:08,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 19:58:08,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 267 [2023-08-03 19:58:08,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 19:58:09,598 INFO L124 PetriNetUnfolderBase]: 13632/21221 cut-off events. [2023-08-03 19:58:09,598 INFO L125 PetriNetUnfolderBase]: For 8795/8795 co-relation queries the response was YES. [2023-08-03 19:58:09,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46574 conditions, 21221 events. 13632/21221 cut-off events. For 8795/8795 co-relation queries the response was YES. Maximal size of possible extension queue 679. Compared 155699 event pairs, 5303 based on Foata normal form. 500/21246 useless extension candidates. Maximal degree in co-relation 44020. Up to 7668 conditions per place. [2023-08-03 19:58:09,811 INFO L140 encePairwiseOnDemand]: 263/267 looper letters, 79 selfloop transitions, 4 changer transitions 0/107 dead transitions. [2023-08-03 19:58:09,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 107 transitions, 470 flow [2023-08-03 19:58:09,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 19:58:09,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 19:58:09,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 601 transitions. [2023-08-03 19:58:09,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5627340823970037 [2023-08-03 19:58:09,814 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 601 transitions. [2023-08-03 19:58:09,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 601 transitions. [2023-08-03 19:58:09,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 19:58:09,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 601 transitions. [2023-08-03 19:58:09,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 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) [2023-08-03 19:58:09,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 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) [2023-08-03 19:58:09,817 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 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) [2023-08-03 19:58:09,817 INFO L175 Difference]: Start difference. First operand has 81 places, 69 transitions, 220 flow. Second operand 4 states and 601 transitions. [2023-08-03 19:58:09,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 107 transitions, 470 flow [2023-08-03 19:58:09,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 107 transitions, 464 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 19:58:09,878 INFO L231 Difference]: Finished difference. Result has 83 places, 70 transitions, 234 flow [2023-08-03 19:58:09,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=83, PETRI_TRANSITIONS=70} [2023-08-03 19:58:09,879 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 15 predicate places. [2023-08-03 19:58:09,879 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 70 transitions, 234 flow [2023-08-03 19:58:09,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.2) internal successors, (681), 5 states have internal predecessors, (681), 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) [2023-08-03 19:58:09,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 19:58:09,879 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 19:58:09,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-03 19:58:10,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-03 19:58:10,081 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 19:58:10,081 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 19:58:10,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1439240389, now seen corresponding path program 1 times [2023-08-03 19:58:10,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 19:58:10,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117653268] [2023-08-03 19:58:10,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 19:58:10,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 19:58:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 19:58:10,138 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-03 19:58:10,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 19:58:10,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117653268] [2023-08-03 19:58:10,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117653268] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 19:58:10,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819683644] [2023-08-03 19:58:10,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 19:58:10,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 19:58:10,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 19:58:10,140 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 19:58:10,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-03 19:58:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 19:58:10,209 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 19:58:10,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 19:58:10,219 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-03 19:58:10,219 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 19:58:10,229 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-03 19:58:10,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819683644] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 19:58:10,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 19:58:10,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 19:58:10,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039083680] [2023-08-03 19:58:10,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 19:58:10,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 19:58:10,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 19:58:10,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 19:58:10,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 19:58:10,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 267 [2023-08-03 19:58:10,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 70 transitions, 234 flow. Second operand has 5 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 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) [2023-08-03 19:58:10,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 19:58:10,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 267 [2023-08-03 19:58:10,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 19:58:11,441 INFO L124 PetriNetUnfolderBase]: 13616/21656 cut-off events. [2023-08-03 19:58:11,441 INFO L125 PetriNetUnfolderBase]: For 12278/12278 co-relation queries the response was YES. [2023-08-03 19:58:11,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49910 conditions, 21656 events. 13616/21656 cut-off events. For 12278/12278 co-relation queries the response was YES. Maximal size of possible extension queue 710. Compared 163282 event pairs, 13009 based on Foata normal form. 21/21192 useless extension candidates. Maximal degree in co-relation 47274. Up to 18017 conditions per place. [2023-08-03 19:58:11,527 INFO L140 encePairwiseOnDemand]: 263/267 looper letters, 79 selfloop transitions, 3 changer transitions 2/108 dead transitions. [2023-08-03 19:58:11,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 108 transitions, 486 flow [2023-08-03 19:58:11,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 19:58:11,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 19:58:11,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 601 transitions. [2023-08-03 19:58:11,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5627340823970037 [2023-08-03 19:58:11,529 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 601 transitions. [2023-08-03 19:58:11,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 601 transitions. [2023-08-03 19:58:11,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 19:58:11,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 601 transitions. [2023-08-03 19:58:11,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 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) [2023-08-03 19:58:11,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 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) [2023-08-03 19:58:11,531 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 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) [2023-08-03 19:58:11,531 INFO L175 Difference]: Start difference. First operand has 83 places, 70 transitions, 234 flow. Second operand 4 states and 601 transitions. [2023-08-03 19:58:11,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 108 transitions, 486 flow [2023-08-03 19:58:11,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 108 transitions, 482 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-03 19:58:11,656 INFO L231 Difference]: Finished difference. Result has 87 places, 69 transitions, 238 flow [2023-08-03 19:58:11,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=238, PETRI_PLACES=87, PETRI_TRANSITIONS=69} [2023-08-03 19:58:11,656 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 19 predicate places. [2023-08-03 19:58:11,656 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 69 transitions, 238 flow [2023-08-03 19:58:11,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 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) [2023-08-03 19:58:11,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 19:58:11,657 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 19:58:11,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-03 19:58:11,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 19:58:11,861 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 19:58:11,861 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 19:58:11,861 INFO L85 PathProgramCache]: Analyzing trace with hash 603394173, now seen corresponding path program 1 times [2023-08-03 19:58:11,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 19:58:11,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104059153] [2023-08-03 19:58:11,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 19:58:11,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 19:58:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 19:58:11,921 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 19:58:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 19:58:11,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 19:58:11,981 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 19:58:11,981 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-03 19:58:11,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-03 19:58:11,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-03 19:58:11,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-03 19:58:11,982 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 19:58:11,984 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 19:58:11,984 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 19:58:12,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 07:58:12 BasicIcfg [2023-08-03 19:58:12,044 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 19:58:12,045 INFO L158 Benchmark]: Toolchain (without parser) took 30595.31ms. Allocated memory was 620.8MB in the beginning and 12.0GB in the end (delta: 11.4GB). Free memory was 576.6MB in the beginning and 9.3GB in the end (delta: -8.8GB). Peak memory consumption was 2.6GB. Max. memory is 16.0GB. [2023-08-03 19:58:12,045 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 394.3MB. Free memory is still 342.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 19:58:12,045 INFO L158 Benchmark]: CACSL2BoogieTranslator took 160.27ms. Allocated memory is still 620.8MB. Free memory was 576.3MB in the beginning and 564.8MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-08-03 19:58:12,045 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.15ms. Allocated memory is still 620.8MB. Free memory was 564.8MB in the beginning and 562.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 19:58:12,045 INFO L158 Benchmark]: Boogie Preprocessor took 19.91ms. Allocated memory is still 620.8MB. Free memory was 562.7MB in the beginning and 561.3MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-03 19:58:12,045 INFO L158 Benchmark]: RCFGBuilder took 382.38ms. Allocated memory is still 620.8MB. Free memory was 560.9MB in the beginning and 541.3MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-03 19:58:12,045 INFO L158 Benchmark]: TraceAbstraction took 30003.63ms. Allocated memory was 620.8MB in the beginning and 12.0GB in the end (delta: 11.4GB). Free memory was 540.6MB in the beginning and 9.3GB in the end (delta: -8.8GB). Peak memory consumption was 2.6GB. Max. memory is 16.0GB. [2023-08-03 19:58:12,046 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 394.3MB. Free memory is still 342.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 160.27ms. Allocated memory is still 620.8MB. Free memory was 576.3MB in the beginning and 564.8MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 25.15ms. Allocated memory is still 620.8MB. Free memory was 564.8MB in the beginning and 562.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 19.91ms. Allocated memory is still 620.8MB. Free memory was 562.7MB in the beginning and 561.3MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 382.38ms. Allocated memory is still 620.8MB. Free memory was 560.9MB in the beginning and 541.3MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 30003.63ms. Allocated memory was 620.8MB in the beginning and 12.0GB in the end (delta: 11.4GB). Free memory was 540.6MB in the beginning and 9.3GB in the end (delta: -8.8GB). Peak memory consumption was 2.6GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 125 PlacesBefore, 42 PlacesAfterwards, 130 TransitionsBefore, 41 TransitionsAfterwards, 2310 CoEnabledTransitionPairs, 8 FixpointIterations, 50 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 11 ConcurrentYvCompositions, 6 ChoiceCompositions, 99 TotalNumberOfCompositions, 12780 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4355, independent: 4035, independent conditional: 0, independent unconditional: 4035, dependent: 320, dependent conditional: 0, dependent unconditional: 320, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1035, independent: 1017, independent conditional: 0, independent unconditional: 1017, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4355, independent: 3018, independent conditional: 0, independent unconditional: 3018, dependent: 302, dependent conditional: 0, dependent unconditional: 302, unknown: 1035, unknown conditional: 0, unknown unconditional: 1035] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 153, Positive conditional cache size: 0, Positive unconditional cache size: 153, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 153 PlacesBefore, 68 PlacesAfterwards, 158 TransitionsBefore, 67 TransitionsAfterwards, 6028 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 11 ConcurrentYvCompositions, 6 ChoiceCompositions, 101 TotalNumberOfCompositions, 41603 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14158, independent: 13593, independent conditional: 0, independent unconditional: 13593, dependent: 565, dependent conditional: 0, dependent unconditional: 565, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2643, independent: 2590, independent conditional: 0, independent unconditional: 2590, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 14158, independent: 11003, independent conditional: 0, independent unconditional: 11003, dependent: 512, dependent conditional: 0, dependent unconditional: 512, unknown: 2643, unknown conditional: 0, unknown unconditional: 2643] , Statistics on independence cache: Total cache size (in pairs): 730, Positive cache size: 686, Positive conditional cache size: 0, Positive unconditional cache size: 686, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 130]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] 0 _Bool e1, e2; [L39] 0 int n1, n2, i, i1, i2; [L110] 0 pthread_t t1[2], t2[2]; [L113] 0 e1 = __VERIFIER_nondet_bool() [L114] 0 e2 = __VERIFIER_nondet_bool() [L115] 0 n1 = __VERIFIER_nondet_int() [L116] 0 n2 = __VERIFIER_nondet_int() [L117] 0 i = __VERIFIER_nondet_int() [L118] 0 i1 = __VERIFIER_nondet_int() [L119] 0 i2 = __VERIFIER_nondet_int() [L122] CALL 0 assume_abort_if_not( ( i == 0 ) && ( e1 == 0 ) && ( e2 == 0 ) && ( n1 == 0 ) && ( n2 == 0 ) ) [L35] COND FALSE 0 !(!cond) [L122] RET 0 assume_abort_if_not( ( i == 0 ) && ( e1 == 0 ) && ( e2 == 0 ) && ( n1 == 0 ) && ( n2 == 0 ) ) [L124] 0 int asdf=0; VAL [asdf=0, e1=0, e2=0, i=0, i=0, i=0, n1=0, n2=0, t1={3:0}, t2={5:0}] [L124] COND TRUE 0 asdf<2 [L124] FCALL, FORK 0 pthread_create(&t1[asdf], 0, thread1, 0) VAL [asdf=0, e1=0, e2=0, i=0, i=0, i=0, n1=0, n2=0, pthread_create(&t1[asdf], 0, thread1, 0)=2147483644, t1={3:0}, t2={5:0}] [L43] 1 e1 = 1 VAL [e1=1, e2=0, i=0, i=0, i=0, n1=0, n2=0] [L46] 1 n1 = (n1 < n2) ? n2 : n1 VAL [e1=1, e2=0, i=0, i=0, i=0, n1=0, n2=0] [L49] 1 n1++ VAL [e1=1, e2=0, i=0, i=0, i=0, n1=1, n2=0] [L52] 1 e1 = 0 VAL [e1=0, e2=0, i=0, i=0, i=0, n1=1, n2=0] [L56] CALL 1 assume_abort_if_not(!e2) [L35] COND FALSE 1 !(!cond) [L56] RET 1 assume_abort_if_not(!e2) [L124] 0 asdf++ VAL [asdf=1, e1=0, e2=0, i=0, i=0, i=0, n1=1, n2=0, t1={3:0}, t2={5:0}] [L124] COND TRUE 0 asdf<2 [L124] FCALL, FORK 0 pthread_create(&t1[asdf], 0, thread1, 0) VAL [asdf=1, e1=0, e2=0, i=0, i=0, i=0, n1=1, n2=0, pthread_create(&t1[asdf], 0, thread1, 0)=2147483645, t1={3:0}, t2={5:0}] [L43] 2 e1 = 1 VAL [e1=1, e2=0, i=0, i=0, i=0, n1=1, n2=0] [L46] 2 n1 = (n1 < n2) ? n2 : n1 VAL [e1=1, e2=0, i=0, i=0, i=0, n1=1, n2=0] [L49] 2 n1++ VAL [e1=1, e2=0, i=0, i=0, i=0, n1=2, n2=0] [L52] 2 e1 = 0 VAL [e1=0, e2=0, i=0, i=0, i=0, n1=2, n2=0] [L56] CALL 2 assume_abort_if_not(!e2) [L35] COND FALSE 2 !(!cond) [L56] RET 2 assume_abort_if_not(!e2) [L124] 0 asdf++ VAL [asdf=2, e1=0, e2=0, i=0, i=0, i=0, n1=2, n2=0, t1={3:0}, t2={5:0}] [L59] CALL 1 assume_abort_if_not( !( ( n2 != 0 ) && ( ( n2 < n1 ) || ( ( n2 == n1 ) && ( 2 < 1 ) ) ) ) ) [L35] COND FALSE 1 !(!cond) [L59] RET 1 assume_abort_if_not( !( ( n2 != 0 ) && ( ( n2 < n1 ) || ( ( n2 == n1 ) && ( 2 < 1 ) ) ) ) ) [L63] 1 i1 = i VAL [e1=0, e2=0, i=0, i=0, i=0, n1=2, n2=0] [L66] 1 i = i1 + 1 VAL [e1=0, e2=0, i=0, i=0, i=1, n1=2, n2=0] [L69] 1 n1 = 0 [L72] 1 return 0; [L124] COND FALSE 0 !(asdf<2) [L125] 0 int asdf=0; VAL [asdf=0, asdf=2, e1=0, e2=0, i=0, i=0, i=1, n1=0, n2=0, t1={3:0}, t2={5:0}] [L125] COND TRUE 0 asdf<2 [L125] FCALL, FORK 0 pthread_create(&t2[asdf], 0, thread2, 0) VAL [asdf=0, asdf=2, e1=0, e2=0, i=0, i=0, i=1, n1=0, n2=0, pthread_create(&t2[asdf], 0, thread2, 0)=2147483646, t1={3:0}, t2={5:0}] [L77] 3 e2 = 1 VAL [e1=0, e2=1, i=0, i=0, i=1, n1=0, n2=0] [L80] 3 n2 = (n2 < n1) ? n1 : n2 VAL [e1=0, e2=1, i=0, i=0, i=1, n1=0, n2=0] [L83] 3 n2++ VAL [e1=0, e2=1, i=0, i=0, i=1, n1=0, n2=1] [L86] 3 e2 = 0 VAL [e1=0, e2=0, i=0, i=0, i=1, n1=0, n2=1] [L90] CALL 3 assume_abort_if_not(!e1) [L35] COND FALSE 3 !(!cond) [L90] RET 3 assume_abort_if_not(!e1) [L59] CALL 2 assume_abort_if_not( !( ( n2 != 0 ) && ( ( n2 < n1 ) || ( ( n2 == n1 ) && ( 2 < 1 ) ) ) ) ) [L35] COND FALSE 2 !(!cond) [L59] RET 2 assume_abort_if_not( !( ( n2 != 0 ) && ( ( n2 < n1 ) || ( ( n2 == n1 ) && ( 2 < 1 ) ) ) ) ) [L63] 2 i1 = i VAL [\result={0:0}, e1=0, e2=0, i=0, i=1, i=1, n1=0, n2=1] [L66] 2 i = i1 + 1 VAL [\result={0:0}, e1=0, e2=0, i=0, i=1, i=2, n1=0, n2=1] [L69] 2 n1 = 0 [L72] 2 return 0; [L125] 0 asdf++ VAL [asdf=1, asdf=2, e1=0, e2=0, i=0, i=1, i=2, n1=0, n2=1, t1={3:0}, t2={5:0}] [L125] COND TRUE 0 asdf<2 [L125] FCALL, FORK 0 pthread_create(&t2[asdf], 0, thread2, 0) VAL [asdf=1, asdf=2, e1=0, e2=0, i=0, i=1, i=2, n1=0, n2=1, pthread_create(&t2[asdf], 0, thread2, 0)=2147483647, t1={3:0}, t2={5:0}] [L77] 4 e2 = 1 VAL [e1=0, e2=1, i=0, i=1, i=2, n1=0, n2=1] [L80] 4 n2 = (n2 < n1) ? n1 : n2 VAL [e1=0, e2=1, i=0, i=1, i=2, n1=0, n2=1] [L83] 4 n2++ VAL [e1=0, e2=1, i=0, i=1, i=2, n1=0, n2=2] [L86] 4 e2 = 0 VAL [e1=0, e2=0, i=0, i=1, i=2, n1=0, n2=2] [L90] CALL 4 assume_abort_if_not(!e1) [L35] COND FALSE 4 !(!cond) [L90] RET 4 assume_abort_if_not(!e1) [L125] 0 asdf++ VAL [asdf=2, asdf=2, e1=0, e2=0, i=0, i=1, i=2, n1=0, n2=2, t1={3:0}, t2={5:0}] [L93] CALL 3 assume_abort_if_not( !( ( n1 != 0 ) && ( ( n1 < n2 ) || ( ( n1 == n2 ) && ( 1 < 2 ) ) ) ) ) [L35] COND FALSE 3 !(!cond) [L93] RET 3 assume_abort_if_not( !( ( n1 != 0 ) && ( ( n1 < n2 ) || ( ( n1 == n2 ) && ( 1 < 2 ) ) ) ) ) [L97] 3 i2 = i VAL [e1=0, e2=0, i=1, i=2, i=2, n1=0, n2=2] [L100] 3 i = i2 + 1 VAL [e1=0, e2=0, i=1, i=2, i=3, n1=0, n2=2] [L103] 3 n2 = 0 [L106] 3 return 0; [L125] COND FALSE 0 !(asdf<2) [L126] 0 int asdf=0; VAL [asdf=0, asdf=2, asdf=2, e1=0, e2=0, i=1, i=2, i=3, n1=0, n2=0, t1={3:0}, t2={5:0}] [L126] COND TRUE 0 asdf<2 [L126] 0 t1[asdf] VAL [asdf=0, asdf=2, asdf=2, e1=0, e2=0, i=1, i=2, i=3, n1=0, n2=0, t1={3:0}, t1[asdf]=2147483644, t2={5:0}] [L93] CALL 4 assume_abort_if_not( !( ( n1 != 0 ) && ( ( n1 < n2 ) || ( ( n1 == n2 ) && ( 1 < 2 ) ) ) ) ) [L35] COND FALSE 4 !(!cond) [L93] RET 4 assume_abort_if_not( !( ( n1 != 0 ) && ( ( n1 < n2 ) || ( ( n1 == n2 ) && ( 1 < 2 ) ) ) ) ) [L97] 4 i2 = i VAL [\result={0:0}, e1=0, e2=0, i=1, i=3, i=3, n1=0, n2=0] [L100] 4 i = i2 + 1 VAL [\result={0:0}, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0] [L103] 4 n2 = 0 [L106] 4 return 0; [L126] FCALL, JOIN 1 pthread_join(t1[asdf], 0) VAL [asdf=0, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t1[asdf]=2147483644, t2={5:0}] [L126] 0 asdf++ VAL [asdf=1, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t2={5:0}] [L126] COND TRUE 0 asdf<2 [L126] 0 t1[asdf] VAL [asdf=1, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t1[asdf]=2147483645, t2={5:0}] [L126] FCALL, JOIN 2 pthread_join(t1[asdf], 0) VAL [asdf=1, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t1[asdf]=2147483645, t2={5:0}] [L126] 0 asdf++ VAL [asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t2={5:0}] [L126] COND FALSE 0 !(asdf<2) [L127] 0 int asdf=0; VAL [asdf=0, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t2={5:0}] [L127] COND TRUE 0 asdf<2 [L127] 0 t2[asdf] VAL [asdf=0, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t2={5:0}, t2[asdf]=2147483646] [L127] FCALL, JOIN 3 pthread_join(t2[asdf], 0) VAL [asdf=0, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t2={5:0}, t2[asdf]=2147483646] [L127] 0 asdf++ VAL [asdf=1, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t2={5:0}] [L127] COND TRUE 0 asdf<2 [L127] 0 t2[asdf] VAL [asdf=1, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t2={5:0}, t2[asdf]=2147483647] [L127] FCALL, JOIN 4 pthread_join(t2[asdf], 0) VAL [asdf=1, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t2={5:0}, t2[asdf]=2147483647] [L127] 0 asdf++ VAL [asdf=2, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t2={5:0}] [L127] COND FALSE 0 !(asdf<2) [L129] CALL 0 assume_abort_if_not( i != 2 ) [L35] COND FALSE 0 !(!cond) [L129] RET 0 assume_abort_if_not( i != 2 ) [L130] 0 reach_error() VAL [asdf=2, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t2={5:0}] - UnprovableResult [Line: 124]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 125]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 153 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.8s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 64 IncrementalHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 64 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=1, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 177 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 27.0s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 21.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 595 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 506 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1233 IncrementalHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 18 mSDtfsCounter, 1233 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 437 GetRequests, 399 SyntacticMatches, 8 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=238occurred in iteration=10, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 576 NumberOfCodeBlocks, 576 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 646 ConstructedInterpolants, 0 QuantifiedInterpolants, 900 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1264 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 23 InterpolantComputations, 6 PerfectInterpolantSequences, 191/216 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-03 19:58:12,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...