/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/triangular-longest-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.fix-rcfgbuilder-lbe-0ccecc1-m [2023-11-10 11:30:50,541 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-10 11:30:50,604 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-10 11:30:50,630 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-10 11:30:50,631 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-10 11:30:50,631 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-10 11:30:50,631 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-10 11:30:50,632 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-10 11:30:50,632 INFO L153 SettingsManager]: * Use SBE=true [2023-11-10 11:30:50,635 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-10 11:30:50,635 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-10 11:30:50,635 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-10 11:30:50,635 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-10 11:30:50,636 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-10 11:30:50,637 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-10 11:30:50,637 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-10 11:30:50,637 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-10 11:30:50,637 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-10 11:30:50,637 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-10 11:30:50,637 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-10 11:30:50,637 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-10 11:30:50,638 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-10 11:30:50,638 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-10 11:30:50,638 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-10 11:30:50,639 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-10 11:30:50,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 11:30:50,639 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-10 11:30:50,639 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-10 11:30:50,639 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-10 11:30:50,639 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-10 11:30:50,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-10 11:30:50,640 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-10 11:30:50,641 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-10 11:30:50,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2023-11-10 11:30:50,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-10 11:30:50,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-10 11:30:50,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-10 11:30:50,839 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-10 11:30:50,841 INFO L274 PluginConnector]: CDTParser initialized [2023-11-10 11:30:50,841 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longest-2.i [2023-11-10 11:30:51,839 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-10 11:30:52,003 INFO L384 CDTParser]: Found 1 translation units. [2023-11-10 11:30:52,003 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-2.i [2023-11-10 11:30:52,012 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bf635754/50dc3c37210e43c0b534a5f8e7423cd9/FLAG1bd4b8105 [2023-11-10 11:30:52,022 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bf635754/50dc3c37210e43c0b534a5f8e7423cd9 [2023-11-10 11:30:52,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-10 11:30:52,025 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-10 11:30:52,026 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-10 11:30:52,026 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-10 11:30:52,029 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-10 11:30:52,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:30:52" (1/1) ... [2023-11-10 11:30:52,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a643b03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:30:52, skipping insertion in model container [2023-11-10 11:30:52,031 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:30:52" (1/1) ... [2023-11-10 11:30:52,068 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-10 11:30:52,270 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-2.i[30964,30977] [2023-11-10 11:30:52,273 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 11:30:52,280 INFO L202 MainTranslator]: Completed pre-run [2023-11-10 11:30:52,322 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-2.i[30964,30977] [2023-11-10 11:30:52,323 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 11:30:52,346 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-10 11:30:52,346 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-10 11:30:52,351 INFO L206 MainTranslator]: Completed translation [2023-11-10 11:30:52,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:30:52 WrapperNode [2023-11-10 11:30:52,352 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-10 11:30:52,353 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-10 11:30:52,353 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-10 11:30:52,353 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-10 11:30:52,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:30:52" (1/1) ... [2023-11-10 11:30:52,382 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:30:52" (1/1) ... [2023-11-10 11:30:52,397 INFO L138 Inliner]: procedures = 169, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2023-11-10 11:30:52,397 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-10 11:30:52,398 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-10 11:30:52,398 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-10 11:30:52,398 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-10 11:30:52,404 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:30:52" (1/1) ... [2023-11-10 11:30:52,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:30:52" (1/1) ... [2023-11-10 11:30:52,408 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:30:52" (1/1) ... [2023-11-10 11:30:52,409 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:30:52" (1/1) ... [2023-11-10 11:30:52,421 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:30:52" (1/1) ... [2023-11-10 11:30:52,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:30:52" (1/1) ... [2023-11-10 11:30:52,424 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:30:52" (1/1) ... [2023-11-10 11:30:52,424 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:30:52" (1/1) ... [2023-11-10 11:30:52,426 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-10 11:30:52,426 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-10 11:30:52,426 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-10 11:30:52,426 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-10 11:30:52,427 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:30:52" (1/1) ... [2023-11-10 11:30:52,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 11:30:52,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:30:52,454 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-11-10 11:30:52,467 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-11-10 11:30:52,486 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-10 11:30:52,486 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-10 11:30:52,486 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-10 11:30:52,486 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-10 11:30:52,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-10 11:30:52,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-10 11:30:52,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-10 11:30:52,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-10 11:30:52,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-10 11:30:52,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-10 11:30:52,488 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-10 11:30:52,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-10 11:30:52,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-10 11:30:52,489 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-10 11:30:52,608 INFO L236 CfgBuilder]: Building ICFG [2023-11-10 11:30:52,609 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-10 11:30:52,737 INFO L277 CfgBuilder]: Performing block encoding [2023-11-10 11:30:52,746 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-10 11:30:52,746 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-10 11:30:52,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:30:52 BoogieIcfgContainer [2023-11-10 11:30:52,749 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-10 11:30:52,751 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-10 11:30:52,751 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-10 11:30:52,753 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-10 11:30:52,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:30:52" (1/3) ... [2023-11-10 11:30:52,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@342445e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:30:52, skipping insertion in model container [2023-11-10 11:30:52,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:30:52" (2/3) ... [2023-11-10 11:30:52,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@342445e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:30:52, skipping insertion in model container [2023-11-10 11:30:52,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:30:52" (3/3) ... [2023-11-10 11:30:52,755 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2023-11-10 11:30:52,766 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-10 11:30:52,766 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-10 11:30:52,766 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-10 11:30:52,820 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-10 11:30:52,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 69 transitions, 146 flow [2023-11-10 11:30:52,885 INFO L124 PetriNetUnfolderBase]: 5/67 cut-off events. [2023-11-10 11:30:52,885 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:30:52,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 67 events. 5/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 73 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2023-11-10 11:30:52,894 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 69 transitions, 146 flow [2023-11-10 11:30:52,897 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 67 transitions, 140 flow [2023-11-10 11:30:52,908 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 11:30:52,913 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@40041936, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 11:30:52,913 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-10 11:30:52,930 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 11:30:52,930 INFO L124 PetriNetUnfolderBase]: 4/55 cut-off events. [2023-11-10 11:30:52,930 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:30:52,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:30:52,931 INFO L208 CegarLoopForPetriNet]: trace histogram [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-11-10 11:30:52,932 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-11-10 11:30:52,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:30:52,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1836933457, now seen corresponding path program 1 times [2023-11-10 11:30:52,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:30:52,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384460348] [2023-11-10 11:30:52,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:30:52,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:30:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:30:53,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:30:53,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:30:53,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384460348] [2023-11-10 11:30:53,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384460348] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:30:53,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:30:53,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-10 11:30:53,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334569107] [2023-11-10 11:30:53,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:30:53,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-10 11:30:53,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:30:53,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-10 11:30:53,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-10 11:30:53,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 69 [2023-11-10 11:30:53,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 140 flow. Second operand has 6 states, 6 states have (on average 54.333333333333336) internal successors, (326), 6 states have internal predecessors, (326), 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-11-10 11:30:53,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:30:53,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 69 [2023-11-10 11:30:53,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:30:53,537 INFO L124 PetriNetUnfolderBase]: 50/237 cut-off events. [2023-11-10 11:30:53,537 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-10 11:30:53,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329 conditions, 237 events. 50/237 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 993 event pairs, 4 based on Foata normal form. 53/272 useless extension candidates. Maximal degree in co-relation 300. Up to 36 conditions per place. [2023-11-10 11:30:53,541 INFO L140 encePairwiseOnDemand]: 57/69 looper letters, 22 selfloop transitions, 21 changer transitions 0/94 dead transitions. [2023-11-10 11:30:53,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 94 transitions, 283 flow [2023-11-10 11:30:53,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-10 11:30:53,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-10 11:30:53,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 597 transitions. [2023-11-10 11:30:53,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8652173913043478 [2023-11-10 11:30:53,557 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 597 transitions. [2023-11-10 11:30:53,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 597 transitions. [2023-11-10 11:30:53,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:30:53,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 597 transitions. [2023-11-10 11:30:53,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 59.7) internal successors, (597), 10 states have internal predecessors, (597), 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-11-10 11:30:53,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 69.0) internal successors, (759), 11 states have internal predecessors, (759), 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-11-10 11:30:53,568 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 69.0) internal successors, (759), 11 states have internal predecessors, (759), 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-11-10 11:30:53,569 INFO L175 Difference]: Start difference. First operand has 69 places, 67 transitions, 140 flow. Second operand 10 states and 597 transitions. [2023-11-10 11:30:53,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 94 transitions, 283 flow [2023-11-10 11:30:53,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 94 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-10 11:30:53,576 INFO L231 Difference]: Finished difference. Result has 84 places, 87 transitions, 296 flow [2023-11-10 11:30:53,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=296, PETRI_PLACES=84, PETRI_TRANSITIONS=87} [2023-11-10 11:30:53,581 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 15 predicate places. [2023-11-10 11:30:53,581 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 87 transitions, 296 flow [2023-11-10 11:30:53,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 54.333333333333336) internal successors, (326), 6 states have internal predecessors, (326), 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-11-10 11:30:53,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:30:53,582 INFO L208 CegarLoopForPetriNet]: trace histogram [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-11-10 11:30:53,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-10 11:30:53,582 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-11-10 11:30:53,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:30:53,582 INFO L85 PathProgramCache]: Analyzing trace with hash -618824555, now seen corresponding path program 1 times [2023-11-10 11:30:53,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:30:53,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600597624] [2023-11-10 11:30:53,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:30:53,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:30:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:30:53,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:30:53,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:30:53,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600597624] [2023-11-10 11:30:53,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600597624] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:30:53,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:30:53,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-10 11:30:53,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886481765] [2023-11-10 11:30:53,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:30:53,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-10 11:30:53,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:30:53,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-10 11:30:53,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-10 11:30:53,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 69 [2023-11-10 11:30:53,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 87 transitions, 296 flow. Second operand has 6 states, 6 states have (on average 54.5) internal successors, (327), 6 states have internal predecessors, (327), 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-11-10 11:30:53,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:30:53,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 69 [2023-11-10 11:30:53,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:30:53,915 INFO L124 PetriNetUnfolderBase]: 55/274 cut-off events. [2023-11-10 11:30:53,916 INFO L125 PetriNetUnfolderBase]: For 138/148 co-relation queries the response was YES. [2023-11-10 11:30:53,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 274 events. 55/274 cut-off events. For 138/148 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1205 event pairs, 0 based on Foata normal form. 10/262 useless extension candidates. Maximal degree in co-relation 471. Up to 43 conditions per place. [2023-11-10 11:30:53,921 INFO L140 encePairwiseOnDemand]: 61/69 looper letters, 16 selfloop transitions, 9 changer transitions 45/113 dead transitions. [2023-11-10 11:30:53,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 113 transitions, 544 flow [2023-11-10 11:30:53,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-10 11:30:53,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-10 11:30:53,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 462 transitions. [2023-11-10 11:30:53,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8369565217391305 [2023-11-10 11:30:53,923 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 462 transitions. [2023-11-10 11:30:53,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 462 transitions. [2023-11-10 11:30:53,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:30:53,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 462 transitions. [2023-11-10 11:30:53,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 57.75) internal successors, (462), 8 states have internal predecessors, (462), 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-11-10 11:30:53,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 69.0) internal successors, (621), 9 states have internal predecessors, (621), 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-11-10 11:30:53,926 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 69.0) internal successors, (621), 9 states have internal predecessors, (621), 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-11-10 11:30:53,926 INFO L175 Difference]: Start difference. First operand has 84 places, 87 transitions, 296 flow. Second operand 8 states and 462 transitions. [2023-11-10 11:30:53,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 113 transitions, 544 flow [2023-11-10 11:30:53,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 113 transitions, 544 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-10 11:30:53,934 INFO L231 Difference]: Finished difference. Result has 95 places, 65 transitions, 233 flow [2023-11-10 11:30:53,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=233, PETRI_PLACES=95, PETRI_TRANSITIONS=65} [2023-11-10 11:30:53,934 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 26 predicate places. [2023-11-10 11:30:53,935 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 65 transitions, 233 flow [2023-11-10 11:30:53,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 54.5) internal successors, (327), 6 states have internal predecessors, (327), 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-11-10 11:30:53,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:30:53,935 INFO L208 CegarLoopForPetriNet]: trace histogram [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-11-10 11:30:53,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-10 11:30:53,936 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:30:53,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:30:53,936 INFO L85 PathProgramCache]: Analyzing trace with hash 2047586317, now seen corresponding path program 1 times [2023-11-10 11:30:53,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:30:53,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504264778] [2023-11-10 11:30:53,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:30:53,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:30:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:30:54,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:30:54,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:30:54,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504264778] [2023-11-10 11:30:54,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504264778] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:30:54,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:30:54,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-10 11:30:54,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873613490] [2023-11-10 11:30:54,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:30:54,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-10 11:30:54,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:30:54,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-10 11:30:54,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-10 11:30:54,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 69 [2023-11-10 11:30:54,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 65 transitions, 233 flow. Second operand has 6 states, 6 states have (on average 54.5) internal successors, (327), 6 states have internal predecessors, (327), 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-11-10 11:30:54,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:30:54,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 69 [2023-11-10 11:30:54,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:30:54,179 INFO L124 PetriNetUnfolderBase]: 37/215 cut-off events. [2023-11-10 11:30:54,179 INFO L125 PetriNetUnfolderBase]: For 262/269 co-relation queries the response was YES. [2023-11-10 11:30:54,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 431 conditions, 215 events. 37/215 cut-off events. For 262/269 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 804 event pairs, 0 based on Foata normal form. 10/206 useless extension candidates. Maximal degree in co-relation 385. Up to 35 conditions per place. [2023-11-10 11:30:54,181 INFO L140 encePairwiseOnDemand]: 63/69 looper letters, 23 selfloop transitions, 11 changer transitions 8/85 dead transitions. [2023-11-10 11:30:54,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 85 transitions, 453 flow [2023-11-10 11:30:54,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 11:30:54,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 11:30:54,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 512 transitions. [2023-11-10 11:30:54,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8244766505636071 [2023-11-10 11:30:54,182 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 512 transitions. [2023-11-10 11:30:54,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 512 transitions. [2023-11-10 11:30:54,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:30:54,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 512 transitions. [2023-11-10 11:30:54,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 56.888888888888886) internal successors, (512), 9 states have internal predecessors, (512), 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-11-10 11:30:54,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 69.0) internal successors, (690), 10 states have internal predecessors, (690), 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-11-10 11:30:54,186 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 69.0) internal successors, (690), 10 states have internal predecessors, (690), 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-11-10 11:30:54,186 INFO L175 Difference]: Start difference. First operand has 95 places, 65 transitions, 233 flow. Second operand 9 states and 512 transitions. [2023-11-10 11:30:54,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 85 transitions, 453 flow [2023-11-10 11:30:54,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 85 transitions, 383 flow, removed 25 selfloop flow, removed 9 redundant places. [2023-11-10 11:30:54,190 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 285 flow [2023-11-10 11:30:54,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=285, PETRI_PLACES=84, PETRI_TRANSITIONS=70} [2023-11-10 11:30:54,191 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 15 predicate places. [2023-11-10 11:30:54,191 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 70 transitions, 285 flow [2023-11-10 11:30:54,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 54.5) internal successors, (327), 6 states have internal predecessors, (327), 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-11-10 11:30:54,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:30:54,192 INFO L208 CegarLoopForPetriNet]: trace histogram [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-11-10 11:30:54,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-10 11:30:54,192 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-11-10 11:30:54,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:30:54,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1252191253, now seen corresponding path program 2 times [2023-11-10 11:30:54,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:30:54,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394940979] [2023-11-10 11:30:54,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:30:54,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:30:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:30:54,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:30:54,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:30:54,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394940979] [2023-11-10 11:30:54,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394940979] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:30:54,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:30:54,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-10 11:30:54,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268410682] [2023-11-10 11:30:54,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:30:54,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-10 11:30:54,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:30:54,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-10 11:30:54,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-10 11:30:54,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 69 [2023-11-10 11:30:54,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 70 transitions, 285 flow. Second operand has 6 states, 6 states have (on average 54.5) internal successors, (327), 6 states have internal predecessors, (327), 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-11-10 11:30:54,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:30:54,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 69 [2023-11-10 11:30:54,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:30:54,383 INFO L124 PetriNetUnfolderBase]: 34/202 cut-off events. [2023-11-10 11:30:54,383 INFO L125 PetriNetUnfolderBase]: For 281/311 co-relation queries the response was YES. [2023-11-10 11:30:54,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 202 events. 34/202 cut-off events. For 281/311 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 744 event pairs, 0 based on Foata normal form. 25/209 useless extension candidates. Maximal degree in co-relation 415. Up to 37 conditions per place. [2023-11-10 11:30:54,384 INFO L140 encePairwiseOnDemand]: 63/69 looper letters, 21 selfloop transitions, 15 changer transitions 11/90 dead transitions. [2023-11-10 11:30:54,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 90 transitions, 532 flow [2023-11-10 11:30:54,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-10 11:30:54,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-10 11:30:54,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 565 transitions. [2023-11-10 11:30:54,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8188405797101449 [2023-11-10 11:30:54,386 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 565 transitions. [2023-11-10 11:30:54,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 565 transitions. [2023-11-10 11:30:54,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:30:54,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 565 transitions. [2023-11-10 11:30:54,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 56.5) internal successors, (565), 10 states have internal predecessors, (565), 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-11-10 11:30:54,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 69.0) internal successors, (759), 11 states have internal predecessors, (759), 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-11-10 11:30:54,388 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 69.0) internal successors, (759), 11 states have internal predecessors, (759), 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-11-10 11:30:54,388 INFO L175 Difference]: Start difference. First operand has 84 places, 70 transitions, 285 flow. Second operand 10 states and 565 transitions. [2023-11-10 11:30:54,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 90 transitions, 532 flow [2023-11-10 11:30:54,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 90 transitions, 507 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-11-10 11:30:54,390 INFO L231 Difference]: Finished difference. Result has 93 places, 75 transitions, 366 flow [2023-11-10 11:30:54,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=366, PETRI_PLACES=93, PETRI_TRANSITIONS=75} [2023-11-10 11:30:54,391 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 24 predicate places. [2023-11-10 11:30:54,391 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 75 transitions, 366 flow [2023-11-10 11:30:54,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 54.5) internal successors, (327), 6 states have internal predecessors, (327), 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-11-10 11:30:54,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:30:54,391 INFO L208 CegarLoopForPetriNet]: trace histogram [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-11-10 11:30:54,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-10 11:30:54,392 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:30:54,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:30:54,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1092167207, now seen corresponding path program 1 times [2023-11-10 11:30:54,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:30:54,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851495925] [2023-11-10 11:30:54,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:30:54,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:30:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:30:54,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:30:54,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:30:54,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851495925] [2023-11-10 11:30:54,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851495925] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:30:54,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:30:54,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 11:30:54,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943062526] [2023-11-10 11:30:54,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:30:54,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 11:30:54,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:30:54,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 11:30:54,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-10 11:30:54,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 69 [2023-11-10 11:30:54,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 75 transitions, 366 flow. Second operand has 7 states, 7 states have (on average 54.42857142857143) internal successors, (381), 7 states have internal predecessors, (381), 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-11-10 11:30:54,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:30:54,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 69 [2023-11-10 11:30:54,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:30:54,566 INFO L124 PetriNetUnfolderBase]: 38/240 cut-off events. [2023-11-10 11:30:54,566 INFO L125 PetriNetUnfolderBase]: For 425/448 co-relation queries the response was YES. [2023-11-10 11:30:54,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 240 events. 38/240 cut-off events. For 425/448 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 987 event pairs, 1 based on Foata normal form. 17/235 useless extension candidates. Maximal degree in co-relation 502. Up to 43 conditions per place. [2023-11-10 11:30:54,567 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 20 selfloop transitions, 25 changer transitions 8/96 dead transitions. [2023-11-10 11:30:54,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 96 transitions, 646 flow [2023-11-10 11:30:54,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-10 11:30:54,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-10 11:30:54,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 672 transitions. [2023-11-10 11:30:54,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8115942028985508 [2023-11-10 11:30:54,569 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 672 transitions. [2023-11-10 11:30:54,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 672 transitions. [2023-11-10 11:30:54,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:30:54,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 672 transitions. [2023-11-10 11:30:54,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 56.0) internal successors, (672), 12 states have internal predecessors, (672), 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-11-10 11:30:54,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 69.0) internal successors, (897), 13 states have internal predecessors, (897), 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-11-10 11:30:54,572 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 69.0) internal successors, (897), 13 states have internal predecessors, (897), 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-11-10 11:30:54,572 INFO L175 Difference]: Start difference. First operand has 93 places, 75 transitions, 366 flow. Second operand 12 states and 672 transitions. [2023-11-10 11:30:54,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 96 transitions, 646 flow [2023-11-10 11:30:54,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 96 transitions, 617 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-11-10 11:30:54,575 INFO L231 Difference]: Finished difference. Result has 103 places, 81 transitions, 490 flow [2023-11-10 11:30:54,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=490, PETRI_PLACES=103, PETRI_TRANSITIONS=81} [2023-11-10 11:30:54,575 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 34 predicate places. [2023-11-10 11:30:54,576 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 81 transitions, 490 flow [2023-11-10 11:30:54,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 54.42857142857143) internal successors, (381), 7 states have internal predecessors, (381), 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-11-10 11:30:54,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:30:54,576 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-11-10 11:30:54,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-10 11:30:54,576 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:30:54,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:30:54,577 INFO L85 PathProgramCache]: Analyzing trace with hash 7231442, now seen corresponding path program 1 times [2023-11-10 11:30:54,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:30:54,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548233305] [2023-11-10 11:30:54,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:30:54,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:30:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:30:54,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:30:54,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:30:54,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548233305] [2023-11-10 11:30:54,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548233305] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 11:30:54,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880147109] [2023-11-10 11:30:54,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:30:54,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:30:54,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:30:54,669 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-11-10 11:30:54,670 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-11-10 11:30:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:30:54,728 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-10 11:30:54,731 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 11:30:54,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:30:54,801 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 11:30:54,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:30:54,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880147109] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 11:30:54,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 11:30:54,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2023-11-10 11:30:54,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151425206] [2023-11-10 11:30:54,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 11:30:54,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-10 11:30:54,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:30:54,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-10 11:30:54,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-11-10 11:30:54,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 69 [2023-11-10 11:30:54,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 81 transitions, 490 flow. Second operand has 13 states, 13 states have (on average 54.61538461538461) internal successors, (710), 13 states have internal predecessors, (710), 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-11-10 11:30:54,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:30:54,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 69 [2023-11-10 11:30:54,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:30:55,107 INFO L124 PetriNetUnfolderBase]: 52/313 cut-off events. [2023-11-10 11:30:55,107 INFO L125 PetriNetUnfolderBase]: For 1303/1345 co-relation queries the response was YES. [2023-11-10 11:30:55,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 908 conditions, 313 events. 52/313 cut-off events. For 1303/1345 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1230 event pairs, 0 based on Foata normal form. 19/305 useless extension candidates. Maximal degree in co-relation 860. Up to 63 conditions per place. [2023-11-10 11:30:55,109 INFO L140 encePairwiseOnDemand]: 63/69 looper letters, 34 selfloop transitions, 19 changer transitions 20/116 dead transitions. [2023-11-10 11:30:55,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 116 transitions, 1140 flow [2023-11-10 11:30:55,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-10 11:30:55,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-11-10 11:30:55,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1066 transitions. [2023-11-10 11:30:55,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.813119755911518 [2023-11-10 11:30:55,111 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1066 transitions. [2023-11-10 11:30:55,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1066 transitions. [2023-11-10 11:30:55,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:30:55,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1066 transitions. [2023-11-10 11:30:55,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 56.10526315789474) internal successors, (1066), 19 states have internal predecessors, (1066), 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-11-10 11:30:55,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 69.0) internal successors, (1380), 20 states have internal predecessors, (1380), 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-11-10 11:30:55,115 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 69.0) internal successors, (1380), 20 states have internal predecessors, (1380), 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-11-10 11:30:55,115 INFO L175 Difference]: Start difference. First operand has 103 places, 81 transitions, 490 flow. Second operand 19 states and 1066 transitions. [2023-11-10 11:30:55,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 116 transitions, 1140 flow [2023-11-10 11:30:55,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 116 transitions, 1016 flow, removed 50 selfloop flow, removed 8 redundant places. [2023-11-10 11:30:55,120 INFO L231 Difference]: Finished difference. Result has 123 places, 87 transitions, 607 flow [2023-11-10 11:30:55,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=607, PETRI_PLACES=123, PETRI_TRANSITIONS=87} [2023-11-10 11:30:55,120 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 54 predicate places. [2023-11-10 11:30:55,120 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 87 transitions, 607 flow [2023-11-10 11:30:55,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 54.61538461538461) internal successors, (710), 13 states have internal predecessors, (710), 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-11-10 11:30:55,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:30:55,121 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-11-10 11:30:55,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-10 11:30:55,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-10 11:30:55,326 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-11-10 11:30:55,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:30:55,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1242711882, now seen corresponding path program 2 times [2023-11-10 11:30:55,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:30:55,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717080059] [2023-11-10 11:30:55,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:30:55,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:30:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:30:55,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:30:55,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:30:55,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717080059] [2023-11-10 11:30:55,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717080059] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 11:30:55,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303754184] [2023-11-10 11:30:55,418 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-10 11:30:55,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:30:55,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:30:55,434 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-11-10 11:30:55,459 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-11-10 11:30:55,499 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-10 11:30:55,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 11:30:55,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-10 11:30:55,501 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 11:30:55,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:30:55,555 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 11:30:55,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:30:55,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303754184] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 11:30:55,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 11:30:55,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2023-11-10 11:30:55,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822998666] [2023-11-10 11:30:55,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 11:30:55,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-10 11:30:55,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:30:55,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-10 11:30:55,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-11-10 11:30:55,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 69 [2023-11-10 11:30:55,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 87 transitions, 607 flow. Second operand has 14 states, 14 states have (on average 54.642857142857146) internal successors, (765), 14 states have internal predecessors, (765), 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-11-10 11:30:55,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:30:55,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 69 [2023-11-10 11:30:55,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:30:55,905 INFO L124 PetriNetUnfolderBase]: 69/463 cut-off events. [2023-11-10 11:30:55,905 INFO L125 PetriNetUnfolderBase]: For 4931/4990 co-relation queries the response was YES. [2023-11-10 11:30:55,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1643 conditions, 463 events. 69/463 cut-off events. For 4931/4990 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2421 event pairs, 0 based on Foata normal form. 20/441 useless extension candidates. Maximal degree in co-relation 1580. Up to 91 conditions per place. [2023-11-10 11:30:55,910 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 29 selfloop transitions, 44 changer transitions 23/139 dead transitions. [2023-11-10 11:30:55,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 139 transitions, 1954 flow [2023-11-10 11:30:55,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-10 11:30:55,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-11-10 11:30:55,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1510 transitions. [2023-11-10 11:30:55,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8105206655931294 [2023-11-10 11:30:55,912 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 1510 transitions. [2023-11-10 11:30:55,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 1510 transitions. [2023-11-10 11:30:55,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:30:55,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 1510 transitions. [2023-11-10 11:30:55,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 55.925925925925924) internal successors, (1510), 27 states have internal predecessors, (1510), 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-11-10 11:30:55,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 69.0) internal successors, (1932), 28 states have internal predecessors, (1932), 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-11-10 11:30:55,918 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 69.0) internal successors, (1932), 28 states have internal predecessors, (1932), 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-11-10 11:30:55,918 INFO L175 Difference]: Start difference. First operand has 123 places, 87 transitions, 607 flow. Second operand 27 states and 1510 transitions. [2023-11-10 11:30:55,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 139 transitions, 1954 flow [2023-11-10 11:30:55,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 139 transitions, 1575 flow, removed 177 selfloop flow, removed 12 redundant places. [2023-11-10 11:30:55,926 INFO L231 Difference]: Finished difference. Result has 148 places, 104 transitions, 956 flow [2023-11-10 11:30:55,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=956, PETRI_PLACES=148, PETRI_TRANSITIONS=104} [2023-11-10 11:30:55,927 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 79 predicate places. [2023-11-10 11:30:55,927 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 104 transitions, 956 flow [2023-11-10 11:30:55,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 54.642857142857146) internal successors, (765), 14 states have internal predecessors, (765), 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-11-10 11:30:55,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:30:55,927 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-11-10 11:30:55,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-10 11:30:56,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-10 11:30:56,149 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-11-10 11:30:56,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:30:56,150 INFO L85 PathProgramCache]: Analyzing trace with hash -561112373, now seen corresponding path program 1 times [2023-11-10 11:30:56,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:30:56,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124047810] [2023-11-10 11:30:56,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:30:56,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:30:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:30:56,269 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:30:56,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:30:56,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124047810] [2023-11-10 11:30:56,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124047810] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 11:30:56,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628530008] [2023-11-10 11:30:56,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:30:56,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:30:56,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:30:56,285 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-11-10 11:30:56,324 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-11-10 11:30:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:30:56,366 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-10 11:30:56,367 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 11:30:56,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:30:56,428 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 11:30:56,548 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:30:56,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628530008] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 11:30:56,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 11:30:56,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2023-11-10 11:30:56,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413593177] [2023-11-10 11:30:56,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 11:30:56,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-10 11:30:56,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:30:56,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-10 11:30:56,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2023-11-10 11:30:56,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 69 [2023-11-10 11:30:56,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 104 transitions, 956 flow. Second operand has 15 states, 15 states have (on average 54.46666666666667) internal successors, (817), 15 states have internal predecessors, (817), 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-11-10 11:30:56,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:30:56,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 69 [2023-11-10 11:30:56,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:30:56,819 INFO L124 PetriNetUnfolderBase]: 100/703 cut-off events. [2023-11-10 11:30:56,819 INFO L125 PetriNetUnfolderBase]: For 15619/15693 co-relation queries the response was YES. [2023-11-10 11:30:56,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3165 conditions, 703 events. 100/703 cut-off events. For 15619/15693 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4380 event pairs, 1 based on Foata normal form. 23/661 useless extension candidates. Maximal degree in co-relation 3090. Up to 141 conditions per place. [2023-11-10 11:30:56,825 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 42 selfloop transitions, 60 changer transitions 20/165 dead transitions. [2023-11-10 11:30:56,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 165 transitions, 3166 flow [2023-11-10 11:30:56,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-10 11:30:56,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-11-10 11:30:56,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1457 transitions. [2023-11-10 11:30:56,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8121516164994426 [2023-11-10 11:30:56,828 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 1457 transitions. [2023-11-10 11:30:56,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 1457 transitions. [2023-11-10 11:30:56,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:30:56,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1457 transitions. [2023-11-10 11:30:56,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 56.03846153846154) internal successors, (1457), 26 states have internal predecessors, (1457), 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-11-10 11:30:56,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 69.0) internal successors, (1863), 27 states have internal predecessors, (1863), 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-11-10 11:30:56,833 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 69.0) internal successors, (1863), 27 states have internal predecessors, (1863), 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-11-10 11:30:56,833 INFO L175 Difference]: Start difference. First operand has 148 places, 104 transitions, 956 flow. Second operand 26 states and 1457 transitions. [2023-11-10 11:30:56,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 165 transitions, 3166 flow [2023-11-10 11:30:56,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 165 transitions, 2575 flow, removed 285 selfloop flow, removed 13 redundant places. [2023-11-10 11:30:56,851 INFO L231 Difference]: Finished difference. Result has 168 places, 123 transitions, 1408 flow [2023-11-10 11:30:56,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1408, PETRI_PLACES=168, PETRI_TRANSITIONS=123} [2023-11-10 11:30:56,851 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 99 predicate places. [2023-11-10 11:30:56,852 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 123 transitions, 1408 flow [2023-11-10 11:30:56,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 54.46666666666667) internal successors, (817), 15 states have internal predecessors, (817), 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-11-10 11:30:56,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:30:56,852 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-11-10 11:30:56,873 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-11-10 11:30:57,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:30:57,057 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-11-10 11:30:57,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:30:57,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1737323563, now seen corresponding path program 2 times [2023-11-10 11:30:57,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:30:57,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936279301] [2023-11-10 11:30:57,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:30:57,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:30:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:30:57,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:30:57,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:30:57,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936279301] [2023-11-10 11:30:57,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936279301] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 11:30:57,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043256185] [2023-11-10 11:30:57,144 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-10 11:30:57,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:30:57,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:30:57,145 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-11-10 11:30:57,179 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-11-10 11:30:57,203 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-10 11:30:57,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 11:30:57,204 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-10 11:30:57,205 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 11:30:57,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:30:57,251 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 11:30:57,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:30:57,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043256185] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 11:30:57,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 11:30:57,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2023-11-10 11:30:57,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870316753] [2023-11-10 11:30:57,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 11:30:57,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-10 11:30:57,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:30:57,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-10 11:30:57,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-11-10 11:30:57,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 69 [2023-11-10 11:30:57,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 123 transitions, 1408 flow. Second operand has 16 states, 16 states have (on average 54.5) internal successors, (872), 16 states have internal predecessors, (872), 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-11-10 11:30:57,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:30:57,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 69 [2023-11-10 11:30:57,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:30:57,631 INFO L124 PetriNetUnfolderBase]: 107/767 cut-off events. [2023-11-10 11:30:57,631 INFO L125 PetriNetUnfolderBase]: For 26198/26313 co-relation queries the response was YES. [2023-11-10 11:30:57,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3897 conditions, 767 events. 107/767 cut-off events. For 26198/26313 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4894 event pairs, 1 based on Foata normal form. 34/730 useless extension candidates. Maximal degree in co-relation 3814. Up to 153 conditions per place. [2023-11-10 11:30:57,639 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 36 selfloop transitions, 82 changer transitions 25/186 dead transitions. [2023-11-10 11:30:57,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 186 transitions, 4234 flow [2023-11-10 11:30:57,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-10 11:30:57,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-11-10 11:30:57,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1510 transitions. [2023-11-10 11:30:57,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8105206655931294 [2023-11-10 11:30:57,641 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 1510 transitions. [2023-11-10 11:30:57,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 1510 transitions. [2023-11-10 11:30:57,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:30:57,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 1510 transitions. [2023-11-10 11:30:57,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 55.925925925925924) internal successors, (1510), 27 states have internal predecessors, (1510), 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-11-10 11:30:57,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 69.0) internal successors, (1932), 28 states have internal predecessors, (1932), 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-11-10 11:30:57,645 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 69.0) internal successors, (1932), 28 states have internal predecessors, (1932), 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-11-10 11:30:57,645 INFO L175 Difference]: Start difference. First operand has 168 places, 123 transitions, 1408 flow. Second operand 27 states and 1510 transitions. [2023-11-10 11:30:57,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 186 transitions, 4234 flow [2023-11-10 11:30:57,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 186 transitions, 3079 flow, removed 547 selfloop flow, removed 19 redundant places. [2023-11-10 11:30:57,694 INFO L231 Difference]: Finished difference. Result has 185 places, 142 transitions, 1801 flow [2023-11-10 11:30:57,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=1061, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1801, PETRI_PLACES=185, PETRI_TRANSITIONS=142} [2023-11-10 11:30:57,695 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 116 predicate places. [2023-11-10 11:30:57,695 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 142 transitions, 1801 flow [2023-11-10 11:30:57,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 54.5) internal successors, (872), 16 states have internal predecessors, (872), 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-11-10 11:30:57,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:30:57,695 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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-11-10 11:30:57,717 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-11-10 11:30:57,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:30:57,900 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-11-10 11:30:57,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:30:57,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1654022269, now seen corresponding path program 3 times [2023-11-10 11:30:57,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:30:57,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568238131] [2023-11-10 11:30:57,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:30:57,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:30:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:30:58,033 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:30:58,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:30:58,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568238131] [2023-11-10 11:30:58,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568238131] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 11:30:58,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502038751] [2023-11-10 11:30:58,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-10 11:30:58,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:30:58,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:30:58,053 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-11-10 11:30:58,054 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-11-10 11:30:58,111 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-10 11:30:58,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 11:30:58,112 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-10 11:30:58,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 11:30:58,183 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:30:58,183 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 11:30:58,318 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:30:58,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502038751] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 11:30:58,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 11:30:58,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2023-11-10 11:30:58,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106162711] [2023-11-10 11:30:58,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 11:30:58,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-10 11:30:58,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:30:58,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-10 11:30:58,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2023-11-10 11:30:58,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 69 [2023-11-10 11:30:58,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 142 transitions, 1801 flow. Second operand has 24 states, 24 states have (on average 54.375) internal successors, (1305), 24 states have internal predecessors, (1305), 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-11-10 11:30:58,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:30:58,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 69 [2023-11-10 11:30:58,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:30:58,928 INFO L124 PetriNetUnfolderBase]: 146/959 cut-off events. [2023-11-10 11:30:58,929 INFO L125 PetriNetUnfolderBase]: For 33930/34147 co-relation queries the response was YES. [2023-11-10 11:30:58,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5228 conditions, 959 events. 146/959 cut-off events. For 33930/34147 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5862 event pairs, 0 based on Foata normal form. 30/902 useless extension candidates. Maximal degree in co-relation 5139. Up to 197 conditions per place. [2023-11-10 11:30:58,940 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 48 selfloop transitions, 121 changer transitions 29/241 dead transitions. [2023-11-10 11:30:58,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 241 transitions, 6233 flow [2023-11-10 11:30:58,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-10 11:30:58,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2023-11-10 11:30:58,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 2626 transitions. [2023-11-10 11:30:58,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8097440641381437 [2023-11-10 11:30:58,943 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 2626 transitions. [2023-11-10 11:30:58,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 2626 transitions. [2023-11-10 11:30:58,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:30:58,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 2626 transitions. [2023-11-10 11:30:58,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 55.87234042553192) internal successors, (2626), 47 states have internal predecessors, (2626), 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-11-10 11:30:58,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 69.0) internal successors, (3312), 48 states have internal predecessors, (3312), 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-11-10 11:30:58,949 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 69.0) internal successors, (3312), 48 states have internal predecessors, (3312), 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-11-10 11:30:58,950 INFO L175 Difference]: Start difference. First operand has 185 places, 142 transitions, 1801 flow. Second operand 47 states and 2626 transitions. [2023-11-10 11:30:58,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 241 transitions, 6233 flow [2023-11-10 11:30:58,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 241 transitions, 5267 flow, removed 445 selfloop flow, removed 20 redundant places. [2023-11-10 11:30:58,987 INFO L231 Difference]: Finished difference. Result has 232 places, 179 transitions, 2823 flow [2023-11-10 11:30:58,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=1441, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=2823, PETRI_PLACES=232, PETRI_TRANSITIONS=179} [2023-11-10 11:30:58,988 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 163 predicate places. [2023-11-10 11:30:58,988 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 179 transitions, 2823 flow [2023-11-10 11:30:58,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 54.375) internal successors, (1305), 24 states have internal predecessors, (1305), 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-11-10 11:30:58,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:30:58,989 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 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-11-10 11:30:59,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-10 11:30:59,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-10 11:30:59,193 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-11-10 11:30:59,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:30:59,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1848292969, now seen corresponding path program 4 times [2023-11-10 11:30:59,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:30:59,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990989836] [2023-11-10 11:30:59,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:30:59,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:30:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:30:59,483 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:30:59,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:30:59,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990989836] [2023-11-10 11:30:59,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990989836] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 11:30:59,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969981191] [2023-11-10 11:30:59,483 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-10 11:30:59,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:30:59,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:30:59,485 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-11-10 11:30:59,529 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-11-10 11:30:59,593 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-10 11:30:59,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 11:30:59,594 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-10 11:30:59,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 11:30:59,738 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:30:59,738 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 11:31:00,136 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:31:00,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969981191] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 11:31:00,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 11:31:00,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 35 [2023-11-10 11:31:00,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494074688] [2023-11-10 11:31:00,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 11:31:00,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-10 11:31:00,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:31:00,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-10 11:31:00,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=923, Unknown=0, NotChecked=0, Total=1190 [2023-11-10 11:31:00,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 69 [2023-11-10 11:31:00,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 179 transitions, 2823 flow. Second operand has 35 states, 35 states have (on average 54.2) internal successors, (1897), 35 states have internal predecessors, (1897), 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-11-10 11:31:00,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:31:00,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 69 [2023-11-10 11:31:00,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:31:01,074 INFO L124 PetriNetUnfolderBase]: 204/1499 cut-off events. [2023-11-10 11:31:01,074 INFO L125 PetriNetUnfolderBase]: For 107444/107716 co-relation queries the response was YES. [2023-11-10 11:31:01,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10182 conditions, 1499 events. 204/1499 cut-off events. For 107444/107716 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9345 event pairs, 1 based on Foata normal form. 37/1391 useless extension candidates. Maximal degree in co-relation 10076. Up to 299 conditions per place. [2023-11-10 11:31:01,092 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 106 selfloop transitions, 110 changer transitions 50/309 dead transitions. [2023-11-10 11:31:01,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 309 transitions, 11284 flow [2023-11-10 11:31:01,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-11-10 11:31:01,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2023-11-10 11:31:01,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 3121 transitions. [2023-11-10 11:31:01,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.807712215320911 [2023-11-10 11:31:01,095 INFO L72 ComplementDD]: Start complementDD. Operand 56 states and 3121 transitions. [2023-11-10 11:31:01,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 3121 transitions. [2023-11-10 11:31:01,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:31:01,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 56 states and 3121 transitions. [2023-11-10 11:31:01,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 57 states, 56 states have (on average 55.732142857142854) internal successors, (3121), 56 states have internal predecessors, (3121), 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-11-10 11:31:01,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 57 states, 57 states have (on average 69.0) internal successors, (3933), 57 states have internal predecessors, (3933), 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-11-10 11:31:01,103 INFO L81 ComplementDD]: Finished complementDD. Result has 57 states, 57 states have (on average 69.0) internal successors, (3933), 57 states have internal predecessors, (3933), 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-11-10 11:31:01,103 INFO L175 Difference]: Start difference. First operand has 232 places, 179 transitions, 2823 flow. Second operand 56 states and 3121 transitions. [2023-11-10 11:31:01,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 309 transitions, 11284 flow [2023-11-10 11:31:01,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 309 transitions, 8874 flow, removed 1173 selfloop flow, removed 24 redundant places. [2023-11-10 11:31:01,209 INFO L231 Difference]: Finished difference. Result has 286 places, 223 transitions, 3946 flow [2023-11-10 11:31:01,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=2103, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=3946, PETRI_PLACES=286, PETRI_TRANSITIONS=223} [2023-11-10 11:31:01,211 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 217 predicate places. [2023-11-10 11:31:01,211 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 223 transitions, 3946 flow [2023-11-10 11:31:01,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 54.2) internal successors, (1897), 35 states have internal predecessors, (1897), 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-11-10 11:31:01,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:31:01,212 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 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-11-10 11:31:01,219 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-11-10 11:31:01,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:31:01,416 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:31:01,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:31:01,417 INFO L85 PathProgramCache]: Analyzing trace with hash 492635131, now seen corresponding path program 5 times [2023-11-10 11:31:01,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:31:01,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493304878] [2023-11-10 11:31:01,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:31:01,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:31:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:31:01,699 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:31:01,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:31:01,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493304878] [2023-11-10 11:31:01,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493304878] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 11:31:01,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900440836] [2023-11-10 11:31:01,699 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-10 11:31:01,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:31:01,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:31:01,700 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-11-10 11:31:01,702 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-11-10 11:31:01,777 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2023-11-10 11:31:01,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 11:31:01,777 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-10 11:31:01,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 11:31:01,922 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:31:01,922 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 11:31:02,335 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:31:02,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900440836] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 11:31:02,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 11:31:02,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2023-11-10 11:31:02,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930285266] [2023-11-10 11:31:02,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 11:31:02,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-10 11:31:02,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:31:02,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-10 11:31:02,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1036, Unknown=0, NotChecked=0, Total=1260 [2023-11-10 11:31:02,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 69 [2023-11-10 11:31:02,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 223 transitions, 3946 flow. Second operand has 36 states, 36 states have (on average 54.22222222222222) internal successors, (1952), 36 states have internal predecessors, (1952), 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-11-10 11:31:02,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:31:02,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 69 [2023-11-10 11:31:02,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:31:03,581 INFO L124 PetriNetUnfolderBase]: 260/2051 cut-off events. [2023-11-10 11:31:03,581 INFO L125 PetriNetUnfolderBase]: For 238614/238909 co-relation queries the response was YES. [2023-11-10 11:31:03,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15753 conditions, 2051 events. 260/2051 cut-off events. For 238614/238909 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 14250 event pairs, 0 based on Foata normal form. 37/1891 useless extension candidates. Maximal degree in co-relation 15628. Up to 409 conditions per place. [2023-11-10 11:31:03,609 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 79 selfloop transitions, 200 changer transitions 50/372 dead transitions. [2023-11-10 11:31:03,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 372 transitions, 15026 flow [2023-11-10 11:31:03,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-11-10 11:31:03,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2023-11-10 11:31:03,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 3458 transitions. [2023-11-10 11:31:03,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8083216456287985 [2023-11-10 11:31:03,613 INFO L72 ComplementDD]: Start complementDD. Operand 62 states and 3458 transitions. [2023-11-10 11:31:03,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 3458 transitions. [2023-11-10 11:31:03,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:31:03,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 62 states and 3458 transitions. [2023-11-10 11:31:03,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 63 states, 62 states have (on average 55.774193548387096) internal successors, (3458), 62 states have internal predecessors, (3458), 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-11-10 11:31:03,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 63 states, 63 states have (on average 69.0) internal successors, (4347), 63 states have internal predecessors, (4347), 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-11-10 11:31:03,622 INFO L81 ComplementDD]: Finished complementDD. Result has 63 states, 63 states have (on average 69.0) internal successors, (4347), 63 states have internal predecessors, (4347), 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-11-10 11:31:03,622 INFO L175 Difference]: Start difference. First operand has 286 places, 223 transitions, 3946 flow. Second operand 62 states and 3458 transitions. [2023-11-10 11:31:03,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 372 transitions, 15026 flow [2023-11-10 11:31:03,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 372 transitions, 12539 flow, removed 1205 selfloop flow, removed 30 redundant places. [2023-11-10 11:31:03,887 INFO L231 Difference]: Finished difference. Result has 336 places, 282 transitions, 5843 flow [2023-11-10 11:31:03,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=3079, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=62, PETRI_FLOW=5843, PETRI_PLACES=336, PETRI_TRANSITIONS=282} [2023-11-10 11:31:03,888 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 267 predicate places. [2023-11-10 11:31:03,888 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 282 transitions, 5843 flow [2023-11-10 11:31:03,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 54.22222222222222) internal successors, (1952), 36 states have internal predecessors, (1952), 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-11-10 11:31:03,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:31:03,888 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 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-11-10 11:31:03,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-10 11:31:04,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:31:04,092 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:31:04,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:31:04,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1868226057, now seen corresponding path program 6 times [2023-11-10 11:31:04,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:31:04,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780221813] [2023-11-10 11:31:04,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:31:04,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:31:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:31:04,347 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:31:04,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:31:04,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780221813] [2023-11-10 11:31:04,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780221813] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 11:31:04,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024014823] [2023-11-10 11:31:04,348 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-10 11:31:04,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:31:04,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:31:04,362 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-11-10 11:31:04,367 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-11-10 11:31:04,438 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2023-11-10 11:31:04,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 11:31:04,439 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-10 11:31:04,440 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 11:31:04,551 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:31:04,551 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 11:31:04,850 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:31:04,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024014823] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 11:31:04,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 11:31:04,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 35 [2023-11-10 11:31:04,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78401803] [2023-11-10 11:31:04,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 11:31:04,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-10 11:31:04,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:31:04,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-10 11:31:04,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 [2023-11-10 11:31:04,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 69 [2023-11-10 11:31:04,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 282 transitions, 5843 flow. Second operand has 35 states, 35 states have (on average 54.22857142857143) internal successors, (1898), 35 states have internal predecessors, (1898), 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-11-10 11:31:04,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:31:04,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 69 [2023-11-10 11:31:04,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:31:06,392 INFO L124 PetriNetUnfolderBase]: 341/2562 cut-off events. [2023-11-10 11:31:06,392 INFO L125 PetriNetUnfolderBase]: For 453964/455058 co-relation queries the response was YES. [2023-11-10 11:31:06,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24163 conditions, 2562 events. 341/2562 cut-off events. For 453964/455058 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 18955 event pairs, 1 based on Foata normal form. 49/2368 useless extension candidates. Maximal degree in co-relation 24018. Up to 533 conditions per place. [2023-11-10 11:31:06,443 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 79 selfloop transitions, 280 changer transitions 50/452 dead transitions. [2023-11-10 11:31:06,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 452 transitions, 21699 flow [2023-11-10 11:31:06,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2023-11-10 11:31:06,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2023-11-10 11:31:06,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 4025 transitions. [2023-11-10 11:31:06,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8101851851851852 [2023-11-10 11:31:06,453 INFO L72 ComplementDD]: Start complementDD. Operand 72 states and 4025 transitions. [2023-11-10 11:31:06,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 4025 transitions. [2023-11-10 11:31:06,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:31:06,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 72 states and 4025 transitions. [2023-11-10 11:31:06,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 73 states, 72 states have (on average 55.90277777777778) internal successors, (4025), 72 states have internal predecessors, (4025), 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-11-10 11:31:06,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 73 states, 73 states have (on average 69.0) internal successors, (5037), 73 states have internal predecessors, (5037), 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-11-10 11:31:06,467 INFO L81 ComplementDD]: Finished complementDD. Result has 73 states, 73 states have (on average 69.0) internal successors, (5037), 73 states have internal predecessors, (5037), 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-11-10 11:31:06,467 INFO L175 Difference]: Start difference. First operand has 336 places, 282 transitions, 5843 flow. Second operand 72 states and 4025 transitions. [2023-11-10 11:31:06,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 452 transitions, 21699 flow [2023-11-10 11:31:06,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 452 transitions, 17842 flow, removed 1865 selfloop flow, removed 34 redundant places. [2023-11-10 11:31:06,976 INFO L231 Difference]: Finished difference. Result has 398 places, 343 transitions, 8152 flow [2023-11-10 11:31:06,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=4370, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=220, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=72, PETRI_FLOW=8152, PETRI_PLACES=398, PETRI_TRANSITIONS=343} [2023-11-10 11:31:06,977 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 329 predicate places. [2023-11-10 11:31:06,977 INFO L495 AbstractCegarLoop]: Abstraction has has 398 places, 343 transitions, 8152 flow [2023-11-10 11:31:06,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 54.22857142857143) internal successors, (1898), 35 states have internal predecessors, (1898), 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-11-10 11:31:06,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:31:06,978 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 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-11-10 11:31:06,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-10 11:31:07,183 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,SelfDestructingSolverStorable12 [2023-11-10 11:31:07,183 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:31:07,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:31:07,184 INFO L85 PathProgramCache]: Analyzing trace with hash -974591634, now seen corresponding path program 7 times [2023-11-10 11:31:07,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:31:07,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158977304] [2023-11-10 11:31:07,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:31:07,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:31:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:31:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:31:07,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:31:07,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158977304] [2023-11-10 11:31:07,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158977304] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 11:31:07,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500086569] [2023-11-10 11:31:07,523 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-10 11:31:07,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:31:07,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:31:07,533 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-11-10 11:31:07,549 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-11-10 11:31:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:31:07,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-10 11:31:07,631 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 11:31:07,753 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:31:07,753 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 11:31:08,199 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:31:08,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500086569] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 11:31:08,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 11:31:08,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 46 [2023-11-10 11:31:08,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709794823] [2023-11-10 11:31:08,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 11:31:08,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-11-10 11:31:08,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:31:08,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-11-10 11:31:08,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=474, Invalid=1596, Unknown=0, NotChecked=0, Total=2070 [2023-11-10 11:31:08,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 69 [2023-11-10 11:31:08,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 343 transitions, 8152 flow. Second operand has 46 states, 46 states have (on average 54.19565217391305) internal successors, (2493), 46 states have internal predecessors, (2493), 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-11-10 11:31:08,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:31:08,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 69 [2023-11-10 11:31:08,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:31:11,102 INFO L124 PetriNetUnfolderBase]: 459/3624 cut-off events. [2023-11-10 11:31:11,102 INFO L125 PetriNetUnfolderBase]: For 981549/981956 co-relation queries the response was YES. [2023-11-10 11:31:11,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39563 conditions, 3624 events. 459/3624 cut-off events. For 981549/981956 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 27403 event pairs, 0 based on Foata normal form. 76/3353 useless extension candidates. Maximal degree in co-relation 39393. Up to 719 conditions per place. [2023-11-10 11:31:11,205 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 103 selfloop transitions, 394 changer transitions 83/623 dead transitions. [2023-11-10 11:31:11,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 487 places, 623 transitions, 39235 flow [2023-11-10 11:31:11,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2023-11-10 11:31:11,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2023-11-10 11:31:11,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 5975 transitions. [2023-11-10 11:31:11,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8092916158743059 [2023-11-10 11:31:11,211 INFO L72 ComplementDD]: Start complementDD. Operand 107 states and 5975 transitions. [2023-11-10 11:31:11,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 5975 transitions. [2023-11-10 11:31:11,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:31:11,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 107 states and 5975 transitions. [2023-11-10 11:31:11,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 108 states, 107 states have (on average 55.8411214953271) internal successors, (5975), 107 states have internal predecessors, (5975), 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-11-10 11:31:11,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 108 states, 108 states have (on average 69.0) internal successors, (7452), 108 states have internal predecessors, (7452), 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-11-10 11:31:11,228 INFO L81 ComplementDD]: Finished complementDD. Result has 108 states, 108 states have (on average 69.0) internal successors, (7452), 108 states have internal predecessors, (7452), 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-11-10 11:31:11,228 INFO L175 Difference]: Start difference. First operand has 398 places, 343 transitions, 8152 flow. Second operand 107 states and 5975 transitions. [2023-11-10 11:31:11,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 487 places, 623 transitions, 39235 flow [2023-11-10 11:31:12,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 623 transitions, 30825 flow, removed 4105 selfloop flow, removed 37 redundant places. [2023-11-10 11:31:12,606 INFO L231 Difference]: Finished difference. Result has 515 places, 457 transitions, 13012 flow [2023-11-10 11:31:12,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=5822, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=281, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=107, PETRI_FLOW=13012, PETRI_PLACES=515, PETRI_TRANSITIONS=457} [2023-11-10 11:31:12,607 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 446 predicate places. [2023-11-10 11:31:12,607 INFO L495 AbstractCegarLoop]: Abstraction has has 515 places, 457 transitions, 13012 flow [2023-11-10 11:31:12,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 54.19565217391305) internal successors, (2493), 46 states have internal predecessors, (2493), 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-11-10 11:31:12,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:31:12,608 INFO L208 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 18, 18, 18, 18, 17, 17, 17, 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-11-10 11:31:12,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-10 11:31:12,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-10 11:31:12,813 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:31:12,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:31:12,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1034821984, now seen corresponding path program 8 times [2023-11-10 11:31:12,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:31:12,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158569789] [2023-11-10 11:31:12,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:31:12,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:31:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:31:13,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1515 backedges. 0 proven. 1515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:31:13,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:31:13,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158569789] [2023-11-10 11:31:13,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158569789] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 11:31:13,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383858453] [2023-11-10 11:31:13,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-10 11:31:13,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:31:13,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:31:13,825 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 11:31:13,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-10 11:31:13,914 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-10 11:31:13,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 11:31:13,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-10 11:31:13,917 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 11:31:14,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1515 backedges. 0 proven. 1515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:31:14,127 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 11:31:14,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1515 backedges. 0 proven. 1515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:31:14,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383858453] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 11:31:14,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 11:31:14,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 47 [2023-11-10 11:31:14,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585431913] [2023-11-10 11:31:14,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 11:31:14,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-11-10 11:31:14,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:31:14,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-11-10 11:31:14,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1699, Unknown=0, NotChecked=0, Total=2162 [2023-11-10 11:31:14,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 69 [2023-11-10 11:31:14,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 457 transitions, 13012 flow. Second operand has 47 states, 47 states have (on average 54.191489361702125) internal successors, (2547), 47 states have internal predecessors, (2547), 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-11-10 11:31:14,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:31:14,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 69 [2023-11-10 11:31:14,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:31:17,717 INFO L124 PetriNetUnfolderBase]: 479/3849 cut-off events. [2023-11-10 11:31:17,718 INFO L125 PetriNetUnfolderBase]: For 1612483/1612900 co-relation queries the response was YES. [2023-11-10 11:31:17,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47053 conditions, 3849 events. 479/3849 cut-off events. For 1612483/1612900 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 28929 event pairs, 0 based on Foata normal form. 42/3520 useless extension candidates. Maximal degree in co-relation 46836. Up to 753 conditions per place. [2023-11-10 11:31:17,848 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 104 selfloop transitions, 462 changer transitions 11/620 dead transitions. [2023-11-10 11:31:17,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 620 transitions, 35479 flow [2023-11-10 11:31:17,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2023-11-10 11:31:17,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2023-11-10 11:31:17,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 4837 transitions. [2023-11-10 11:31:17,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8057637847742796 [2023-11-10 11:31:17,866 INFO L72 ComplementDD]: Start complementDD. Operand 87 states and 4837 transitions. [2023-11-10 11:31:17,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 4837 transitions. [2023-11-10 11:31:17,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:31:17,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 87 states and 4837 transitions. [2023-11-10 11:31:17,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 88 states, 87 states have (on average 55.59770114942529) internal successors, (4837), 87 states have internal predecessors, (4837), 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-11-10 11:31:17,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 88 states, 88 states have (on average 69.0) internal successors, (6072), 88 states have internal predecessors, (6072), 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-11-10 11:31:17,879 INFO L81 ComplementDD]: Finished complementDD. Result has 88 states, 88 states have (on average 69.0) internal successors, (6072), 88 states have internal predecessors, (6072), 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-11-10 11:31:17,879 INFO L175 Difference]: Start difference. First operand has 515 places, 457 transitions, 13012 flow. Second operand 87 states and 4837 transitions. [2023-11-10 11:31:17,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 620 transitions, 35479 flow [2023-11-10 11:31:21,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 522 places, 620 transitions, 25322 flow, removed 4899 selfloop flow, removed 56 redundant places. [2023-11-10 11:31:21,433 INFO L231 Difference]: Finished difference. Result has 534 places, 529 transitions, 11168 flow [2023-11-10 11:31:21,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=8167, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=391, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=87, PETRI_FLOW=11168, PETRI_PLACES=534, PETRI_TRANSITIONS=529} [2023-11-10 11:31:21,440 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 465 predicate places. [2023-11-10 11:31:21,440 INFO L495 AbstractCegarLoop]: Abstraction has has 534 places, 529 transitions, 11168 flow [2023-11-10 11:31:21,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 54.191489361702125) internal successors, (2547), 47 states have internal predecessors, (2547), 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-11-10 11:31:21,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:31:21,441 INFO L208 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 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-11-10 11:31:21,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-10 11:31:21,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-10 11:31:21,667 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 11:31:21,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:31:21,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1505013239, now seen corresponding path program 9 times [2023-11-10 11:31:21,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:31:21,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163331781] [2023-11-10 11:31:21,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:31:21,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:31:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:31:21,707 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-10 11:31:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:31:21,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-10 11:31:21,797 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-10 11:31:21,798 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-11-10 11:31:21,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-11-10 11:31:21,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-11-10 11:31:21,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-10 11:31:21,800 INFO L445 BasicCegarLoop]: Path program histogram: [9, 2, 2, 1, 1, 1] [2023-11-10 11:31:21,804 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-10 11:31:21,804 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-10 11:31:21,881 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-10 11:31:21,883 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-10 11:31:21,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 11:31:21 BasicIcfg [2023-11-10 11:31:21,914 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-10 11:31:21,914 INFO L158 Benchmark]: Toolchain (without parser) took 29889.63ms. Allocated memory was 313.5MB in the beginning and 2.2GB in the end (delta: 1.9GB). Free memory was 274.9MB in the beginning and 1.6GB in the end (delta: -1.3GB). Peak memory consumption was 564.6MB. Max. memory is 8.0GB. [2023-11-10 11:31:21,915 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 190.8MB. Free memory was 146.0MB in the beginning and 145.8MB in the end (delta: 145.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-11-10 11:31:21,915 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.49ms. Allocated memory is still 313.5MB. Free memory was 274.9MB in the beginning and 255.6MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-11-10 11:31:21,915 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.45ms. Allocated memory is still 313.5MB. Free memory was 255.6MB in the beginning and 253.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-10 11:31:21,915 INFO L158 Benchmark]: Boogie Preprocessor took 27.74ms. Allocated memory is still 313.5MB. Free memory was 253.6MB in the beginning and 252.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-10 11:31:21,915 INFO L158 Benchmark]: RCFGBuilder took 323.13ms. Allocated memory is still 313.5MB. Free memory was 252.0MB in the beginning and 239.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-11-10 11:31:21,915 INFO L158 Benchmark]: TraceAbstraction took 29163.12ms. Allocated memory was 313.5MB in the beginning and 2.2GB in the end (delta: 1.9GB). Free memory was 239.0MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 528.9MB. Max. memory is 8.0GB. [2023-11-10 11:31:21,916 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 190.8MB. Free memory was 146.0MB in the beginning and 145.8MB in the end (delta: 145.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 326.49ms. Allocated memory is still 313.5MB. Free memory was 274.9MB in the beginning and 255.6MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.45ms. Allocated memory is still 313.5MB. Free memory was 255.6MB in the beginning and 253.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.74ms. Allocated memory is still 313.5MB. Free memory was 253.6MB in the beginning and 252.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 323.13ms. Allocated memory is still 313.5MB. Free memory was 252.0MB in the beginning and 239.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 29163.12ms. Allocated memory was 313.5MB in the beginning and 2.2GB in the end (delta: 1.9GB). Free memory was 239.0MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 528.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; VAL [i=3, j=6] [L712] 0 pthread_t id1, id2; VAL [\old(argc)=50, argc=50, argv={51:49}, argv={51:49}, i=3, id1={5:0}, id2={3:0}, j=6] [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(argc)=50, arg={0:0}, argc=50, argv={51:49}, argv={51:49}, i=3, id1={5:0}, id2={3:0}, j=6] [L696] 1 int k = 0; VAL [arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, i=7, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(argc)=50, arg={0:0}, arg={0:0}, arg={0:0}, argc=50, argv={51:49}, argv={51:49}, i=7, id1={5:0}, id2={3:0}, j=6, k=0] [L704] 2 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L716] 0 int condI = i >= (2*20 +6); VAL [\old(argc)=50, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=50, argv={51:49}, argv={51:49}, condI=0, i=7, id1={5:0}, id2={3:0}, j=6, k=0, k=0] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=0] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=0, k=1] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=0, k=2] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=0, k=2] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=1, k=2] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=2] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=2, k=3] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=3] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=5] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=5] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=4, k=5] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=5] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=5, k=6] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=6] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=6] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=6] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=7] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=7] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=7] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=7, k=8] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=8] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=8, k=9] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=9, k=9] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=9] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=9] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=10] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=10, k=10] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=10, k=11] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=10, k=11] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=10, k=11] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=10, k=12] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=10, k=12] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=12] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=12] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=11, k=12] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=11, k=12] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=12] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=12] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=12, k=12] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=12, k=13] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=12, k=13] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=12, k=13] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=13] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=13] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=13, k=13] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=13, k=14] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=13, k=14] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=13, k=14] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=14] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=14] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=14, k=14] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=14, k=15] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=14, k=15] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=14, k=15] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=15] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=15] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=15, k=15] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=15, k=16] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=15, k=16] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=15, k=16] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=16] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=16] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=16, k=16] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=16, k=17] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=16, k=17] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=16, k=17] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=17] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=17] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=17, k=17] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=17, k=18] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=17, k=18] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=17, k=18] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=18] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=18] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=18, k=18] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=18, k=19] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=18, k=19] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=18, k=19] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=19] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=19] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=19, k=19] [L719] 0 int condJ = j >= (2*20 +6); VAL [\old(argc)=50, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=50, argv={51:49}, argv={51:49}, condI=0, condJ=1, i=45, id1={5:0}, id2={3:0}, j=46, k=19, k=19] [L721] COND TRUE 0 condI || condJ VAL [\old(argc)=50, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=50, argv={51:49}, argv={51:49}, condI=0, condJ=1, i=45, id1={5:0}, id2={3:0}, j=46, k=19, k=19] [L722] 0 reach_error() VAL [\old(argc)=50, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=50, argv={51:49}, argv={51:49}, condI=0, condJ=1, i=45, id1={5:0}, id2={3:0}, j=46, k=19, k=19] - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 89 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: 29.0s, OverallIterations: 16, TraceHistogramMax: 20, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 18.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2606 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2606 mSDsluCounter, 274 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 204 mSDsCounter, 449 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2823 IncrementalHoareTripleChecker+Invalid, 3272 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 449 mSolverCounterUnsat, 70 mSDtfsCounter, 2823 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2451 GetRequests, 1644 SyntacticMatches, 35 SemanticMatches, 772 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22324 ImplicationChecksByTransitivity, 8.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13012occurred in iteration=14, InterpolantAutomatonStates: 579, 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.4s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 2184 NumberOfCodeBlocks, 2184 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 2810 ConstructedInterpolants, 0 QuantifiedInterpolants, 10548 SizeOfPredicates, 130 NumberOfNonLiveVariables, 2010 ConjunctsInSsa, 188 ConjunctsInUnsatCore, 35 InterpolantComputations, 5 PerfectInterpolantSequences, 0/7335 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-11-10 11:31:21,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...